Method and apparatus for uplink control information omission

ABSTRACT

A method for operating a UE for CSI reporting is provided. The method comprises receiving configuration information for a CSI report, determining the CSI report comprising a first CSI part and a second CSI part, the second CSI part including a precoding matrix indicator (PMI), the PMI comprising a plurality of PMI components, wherein some of the PMI components comprise sub-components, determining priority values for the sub-components of the some of the PMI components, partitioning the second CSI part into Group 0, Group 1, and Group 2 such that the sub-components of the some of the PMI components are divided into Group 1 and Group 2 based on the determined priority values for the sub-components, and transmitting the first CSI part and Group 0 or (Group 0, Group 1) or (Group 0, Group 1, Group 2) of the second CSI part based on a resource allocation for the CSI report.

CROSS-REFERENCE TO RELATED APPLICATION(S) AND CLAIM OF PRIORITY

This application is a continuation of U.S. patent application Ser. No. 17/009,529, filed on Sep. 1, 2020, which claims priority to U.S. Provisional Patent Application No. 62/897,215 filed on Sep. 6, 2019, U.S. Provisional Patent Application No. 62/914,910, filed on Oct. 14, 2019, U.S. Provisional Patent Application No. 62/915,303 filed on Oct. 15, 2019, U.S. Provisional Patent Application No. 62/928,593 filed on Oct. 31, 2019, and U.S. Provisional Patent Application No. 62/937,479, filed on Nov. 19, 2019. The content of the above-identified patent documents is incorporated herein by reference.

TECHNICAL FIELD

The present disclosure relates generally to wireless communication systems and more specifically to channel state information (CSI) reporting and multiplexing.

BACKGROUND

Understanding and correctly estimating the channel between a user equipment (UE) and a base station (BS) (e.g., gNode B (gNB)) is important for efficient and effective wireless communication. In order to correctly estimate the DL channel conditions, the gNB may transmit a reference signal, e.g., CSI-RS, to the UE for DL channel measurement, and the UE may report (e.g., feedback) information about channel measurement, e.g., CSI, to the gNB. With this DL channel measurement, the gNB is able to select appropriate communication parameters to efficiently and effectively perform wireless data communication with the UE.

SUMMARY

Embodiments of the present disclosure provide methods and apparatuses for CSI reporting and multiplexing in a wireless communication system.

In one embodiment, a UE for CSI reporting in a wireless communication system is provided. The UE includes a transceiver configured to receive configuration information for a CSI report. The UE further includes a processor operably connected to the transceiver. The processor is configured to determine the CSI report comprising a first CSI part and a second CSI part, the second CSI part including a precoding matrix indicator (PMI), the PMI comprising a plurality of PMI components, wherein some of the PMI components comprise sub-components. The processor is further configured to determine priority values for the sub-components of the some of the PMI components, and partition the second CSI part into Group 0, Group 1, and Group 2 such that the sub-components of the some of the PMI components are divided into Group 1 and Group 2 based on the determined priority values for the sub-components. The priority values for the sub-components are based on a function F₁(m) that permutes values {0, 1, 2, . . . , M−1} of an index m associated with the sub-components such that the priority values are sorted in decreasing order as {x₀, y₀, x₁, y₁, x₂, y₂ . . . . } where {x₀, x₁, x₂, . . . } and {y₀, y₁, y₂, . . . } are two parts of the index values {0, 1, 2, . . . , M−1} for the index m. The transceiver is further configured to transmit, over an uplink (UL) channel, the first CSI part and Group 0 or (Group 0, Group 1) or (Group 0, Group 1, Group 2) of the second CSI part based on a resource allocation for the CSI report.

In another embodiment, a BS in a wireless communication system is provided. The BS includes a processor configured to generate CSI configuration information. The BS further includes a transceiver operably connected to the processor. The transceiver is configured to transmit the CSI configuration information for a CSI report comprising a first CSI part and a second CSI part, and receive, over an uplink (UL) channel, the first CSI part and Group 0 or (Group 0, Group 1) or (Group 0, Group 1, Group 2) of the second CSI part based on a resource allocation for the CSI report. The second CSI part includes a precoding matrix indicator (PMI), the PMI comprising a plurality of PMI components, wherein some of the PMI components comprise sub-components. The second CSI part is partitioned into Group 0, Group 1, and Group 2 such that the sub-components of the some of the PMI components are divided into Group 1 and Group 2 based on priority values for the sub-components. The priority values for the sub-components are based on a function F₁(m) that permutes values {0, 1, 2, . . . , M−1} of an index m associated with the sub-components such that the priority values are sorted in decreasing order as {x₀, y₀, x₁, y₁, x₂, y₂ . . . . } where {x₀, x₁, x₂, . . . } and {y₀, y₁, y₂, . . . } are two parts of the index values {0, 1, 2, . . . , M−1} for the index m.

In yet another embodiment, a method for operating a UE for CSI reporting in a wireless communication system is provided. The method comprises receiving configuration information for a CSI report, determining the CSI report comprising a first CSI part and a second CSI part, the second CSI part including a precoding matrix indicator (PMI), the PMI comprising a plurality of PMI components, wherein some of the PMI components comprise sub-components, determining priority values for the sub-components of the some of the PMI components, partitioning the second CSI part into Group 0, Group 1, and Group 2 such that the sub-components of the some of the PMI components are divided into Group 1 and Group 2 based on the determined priority values for the sub-components, and transmitting, over an uplink (UL) channel, the first CSI part and Group 0 or (Group 0, Group 1) or (Group 0, Group 1, Group 2) of the second CSI part based on a resource allocation for the CSI report. The priority values for the sub-components are based on a function F₁(m) that permutes values {0, 1, 2, . . . , M−1} of an index m associated with the sub-components such that the priority values are sorted in decreasing order as {x₀, y₀, x₁, y₁, x₂, y₂ . . . . } where {x₀, x₁, x₂, . . . } and {y₀, y₁, y₂, . . . } are two parts of the index values {0, 1, 2, . . . , M−1} for the index m.

Other technical features may be readily apparent to one skilled in the art from the following figures, descriptions, and claims.

Before undertaking the DETAILED DESCRIPTION below, it may be advantageous to set forth definitions of certain words and phrases used throughout this patent document. The term “couple” and its derivatives refer to any direct or indirect communication between two or more elements, whether or not those elements are in physical contact with one another. The terms “transmit,” “receive,” and “communicate,” as well as derivatives thereof, encompass both direct and indirect communication. The terms “include” and “comprise,” as well as derivatives thereof, mean inclusion without limitation. The term “or” is inclusive, meaning and/or. The phrase “associated with,” as well as derivatives thereof, means to include, be included within, interconnect with, contain, be contained within, connect to or with, couple to or with, be communicable with, cooperate with, interleave, juxtapose, be proximate to, be bound to or with, have, have a property of, have a relationship to or with, or the like. The term “controller” means any device, system or part thereof that controls at least one operation. Such a controller may be implemented in hardware or a combination of hardware and software and/or firmware. The functionality associated with any particular controller may be centralized or distributed, whether locally or remotely. The phrase “at least one of,” when used with a list of items, means that different combinations of one or more of the listed items may be used, and only one item in the list may be needed. For example, “at least one of: A, B, and C” includes any of the following combinations: A, B, C, A and B, A and C, B and C, and A and B and C.

Moreover, various functions described below can be implemented or supported by one or more computer programs, each of which is formed from computer readable program code and embodied in a computer readable medium. The terms “application” and “program” refer to one or more computer programs, software components, sets of instructions, procedures, functions, objects, classes, instances, related data, or a portion thereof adapted for implementation in a suitable computer readable program code. The phrase “computer readable program code” includes any type of computer code, including source code, object code, and executable code. The phrase “computer readable medium” includes any type of medium capable of being accessed by a computer, such as read only memory (ROM), random access memory (RAM), a hard disk drive, a compact disc (CD), a digital video disc (DVD), or any other type of memory. A “non-transitory” computer readable medium excludes wired, wireless, optical, or other communication links that transport transitory electrical or other signals. A non-transitory computer readable medium includes media where data can be permanently stored and media where data can be stored and later overwritten, such as a rewritable optical disc or an erasable memory device.

Definitions for other certain words and phrases are provided throughout this patent document. Those of ordinary skill in the art should understand that in many if not most instances, such definitions apply to prior as well as future uses of such defined words and phrases.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present disclosure and its advantages, reference is now made to the following description taken in conjunction with the accompanying drawings, in which like reference numerals represent like parts:

FIG. 1 illustrates an example wireless network according to embodiments of the present disclosure;

FIG. 2 illustrates an example gNB according to embodiments of the present disclosure;

FIG. 3 illustrates an example UE according to embodiments of the present disclosure;

FIG. 4A illustrates a high-level diagram of an orthogonal frequency division multiple access transmit path according to embodiments of the present disclosure;

FIG. 4B illustrates a high-level diagram of an orthogonal frequency division multiple access receive path according to embodiments of the present disclosure;

FIG. 5 illustrates an example of a transmitter block diagram for a PDSCH in a subframe according to embodiments of the present disclosure;

FIG. 6 illustrates an example of a receiver block diagram for a PDSCH in a subframe according to embodiments of the present disclosure;

FIG. 7 illustrates an example of a transmitter block diagram for a PUSCH in a subframe according to embodiments of the present disclosure;

FIG. 8 illustrates an example of a receiver block diagram for a PUSCH in a subframe according to embodiments of the present disclosure;

FIG. 9 illustrates an example multiplexing of two slices according to embodiments of the present disclosure;

FIG. 10 illustrates an example antenna blocks according to embodiments of the present disclosure;

FIG. 11 illustrates an example antenna port layout according to embodiments of the present disclosure;

FIG. 12 illustrates an example of a two-part UCI multiplexing process, as may be performed by a UE, according to embodiments of the present disclosure;

FIG. 13 illustrates an example of a 3D grid of oversampled DFT beams according to embodiments of the present disclosure;

FIG. 14 illustrates an example of a two-part UCI multiplexing process, as may be performed by a UE, according to embodiments of the present disclosure;

FIG. 15 illustrates an example of a two-part UCI multiplexing process, as may be performed by a UE, according to embodiments of the present disclosure;

FIG. 16 illustrates an example sorting scheme according to embodiments of the present disclosure;

FIG. 17 illustrates a flow chart of a method for transmitting an UL transmission including CSI reporting, as may be performed by a UE according to embodiments of the present disclosure; and

FIG. 18 illustrates a flow chart of another method for receiving an UL transmission including CSI reporting, as may be performed by a BS, according to embodiments of the present disclosure.

DETAILED DESCRIPTION

FIG. 1 through FIG. 18 , discussed below, and the various embodiments used to describe the principles of the present disclosure in this patent document are by way of illustration only and should not be construed in any way to limit the scope of the disclosure. Those skilled in the art will understand that the principles of the present disclosure may be implemented in any suitably arranged system or device.

The following documents and standards descriptions are hereby incorporated by reference into the present disclosure as if fully set forth herein: 3GPP TS 36.211 v16.2.0, “E-UTRA, Physical channels and modulation” (herein “REF 1”); 3GPP TS 36.212 v16.2.0, “E-UTRA, Multiplexing and Channel coding” (herein “REF 2”); 3GPP TS 36.213 v16.2.0, “E-UTRA, Physical Layer Procedures” (herein “REF 3”); 3GPP TS 36.321 v16.2.0, “E-UTRA, Medium Access Control (MAC) protocol specification” (herein “REF 4”); 3GPP TS 36.331 v16.2.0, “E-UTRA, Radio Resource Control (RRC) protocol specification” (herein “REF 5”); 3GPP TR 22.891 v14.2.0 (herein “REF 6”); 3GPP TS 38.212 v16.2.0, “E-UTRA, NR, Multiplexing and channel coding” (herein “REF 7”); 3GPP TS 38.214 v16.2.0, “E-UTRA, NR, Physical layer procedures for data” (herein “REF 8”); and 3GPP TS 38.213 v16.2.0, “E-UTRA, NR, Physical Layer Procedures for control” (herein “REF 9”).

Aspects, features, and advantages of the disclosure are readily apparent from the following detailed description, simply by illustrating a number of particular embodiments and implementations, including the best mode contemplated for carrying out the disclosure. The disclosure is also capable of other and different embodiments, and its several details can be modified in various obvious respects, all without departing from the spirit and scope of the disclosure. Accordingly, the drawings and description are to be regarded as illustrative in nature, and not as restrictive. The disclosure is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings.

In the following, for brevity, both FDD and TDD are considered as the duplex method for both DL and UL signaling.

Although exemplary descriptions and embodiments to follow assume orthogonal frequency division multiplexing (OFDM) or orthogonal frequency division multiple access (OFDMA), the present disclosure can be extended to other OFDM-based transmission waveforms or multiple access schemes such as filtered OFDM (F-OFDM).

To meet the demand for wireless data traffic having increased since deployment of 4G communication systems, efforts have been made to develop an improved 5G or pre-5G communication system. Therefore, the 5G or pre-5G communication system is also called a “beyond 4G network” or a “post LTE system.”

The 5G communication system is considered to be implemented in higher frequency (mmWave) bands, e.g., 60 GHz bands, so as to accomplish higher data rates. To decrease propagation loss of the radio waves and increase the transmission coverage, the beamforming, massive multiple-input multiple-output (MIMO), full dimensional MIMO (FD-MIMO), array antenna, an analog beam forming, large scale antenna techniques and the like are discussed in 5G communication systems.

In addition, in 5G communication systems, development for system network improvement is under way based on advanced small cells, cloud radio access networks (RANs), ultra-dense networks, device-to-device (D2D) communication, wireless backhaul communication, moving network, cooperative communication, coordinated multi-points (CoMP) transmission and reception, interference mitigation and cancellation and the like.

FIGS. 1-4B below describe various embodiments implemented in wireless communications systems and with the use of orthogonal frequency division multiplexing (OFDM) or orthogonal frequency division multiple access (OFDMA) communication techniques. The descriptions of FIGS. 1-3 are not meant to imply physical or architectural limitations to the manner in which different embodiments may be implemented. Different embodiments of the present disclosure may be implemented in any suitably-arranged communications system. The present disclosure covers several components which can be used in conjunction or in combination with one another, or can operate as standalone schemes.

FIG. 1 illustrates an example wireless network according to embodiments of the present disclosure. The embodiment of the wireless network shown in FIG. 1 is for illustration only. Other embodiments of the wireless network 100 could be used without departing from the scope of this disclosure.

As shown in FIG. 1 , the wireless network includes a gNB 101, a gNB 102, and a gNB 103. The gNB 101 communicates with the gNB 102 and the gNB 103. The gNB 101 also communicates with at least one network 130, such as the Internet, a proprietary Internet Protocol (IP) network, or other data network.

The gNB 102 provides wireless broadband access to the network 130 for a first plurality of user equipments (UEs) within a coverage area 120 of the gNB 102. The first plurality of UEs includes a UE 111, which may be located in a small business (SB); a UE 112, which may be located in an enterprise (E); a UE 113, which may be located in a WiFi hotspot (HS); a UE 114, which may be located in a first residence (R); a UE 115, which may be located in a second residence (R); and a UE 116, which may be a mobile device (M), such as a cell phone, a wireless laptop, a wireless PDA, or the like. The gNB 103 provides wireless broadband access to the network 130 for a second plurality of UEs within a coverage area 125 of the gNB 103. The second plurality of UEs includes the UE 115 and the UE 116. In some embodiments, one or more of the gNBs 101-103 may communicate with each other and with the UEs 111-116 using 5G, LTE, LTE-A, WiMAX, WiFi, or other wireless communication techniques.

Depending on the network type, the term “base station” or “BS” can refer to any component (or collection of components) configured to provide wireless access to a network, such as transmit point (TP), transmit-receive point (TRP), an enhanced base station (eNodeB or eNB), a 5G base station (gNB), a macrocell, a femtocell, a WiFi access point (AP), or other wirelessly enabled devices. Base stations may provide wireless access in accordance with one or more wireless communication protocols, e.g., 5G 3GPP new radio interface/access (NR), long term evolution (LTE), LTE advanced (LTE-A), high speed packet access (HSPA), Wi-Fi 802.11a/b/g/n/ac, etc. For the sake of convenience, the terms “BS” and “TRP” are used interchangeably in this patent document to refer to network infrastructure components that provide wireless access to remote terminals. Also, depending on the network type, the term “user equipment” or “UE” can refer to any component such as “mobile station,” “subscriber station,” “remote terminal,” “wireless terminal,” “receive point,” or “user device.” For the sake of convenience, the terms “user equipment” and “UE” are used in this patent document to refer to remote wireless equipment that wirelessly accesses a BS, whether the UE is a mobile device (such as a mobile telephone or smartphone) or is normally considered a stationary device (such as a desktop computer or vending machine).

Dotted lines show the approximate extents of the coverage areas 120 and 125, which are shown as approximately circular for the purposes of illustration and explanation only. It should be clearly understood that the coverage areas associated with gNBs, such as the coverage areas 120 and 125, may have other shapes, including irregular shapes, depending upon the configuration of the gNBs and variations in the radio environment associated with natural and man-made obstructions.

As described in more detail below, one or more of the UEs 111-116 include circuitry, programing, or a combination thereof, for CSI reporting including determining a CSI report comprising a first CSI part and a second CSI part, the second CSI part including a precoding matrix indicator (PMI), the PMI comprising a plurality of PMI components, wherein some of the PMI components comprise sub-components; determining priority values for the sub-components of the some of the PMI components; and partitioning the second CSI part into Group 0, Group 1, and Group 2 such that the sub-components of the some of the plurality of PMI components are divided into Group 1 and Group 2 based on their determined priority values. In certain embodiments, one or more of the gNBs 101-103 includes circuitry, programing, or a combination thereof, for CSI acquisition in a wireless communication system.

Although FIG. 1 illustrates one example of a wireless network, various changes may be made to FIG. 1 . For example, the wireless network could include any number of gNBs and any number of UEs in any suitable arrangement. Also, the gNB 101 could communicate directly with any number of UEs and provide those UEs with wireless broadband access to the network 130. Similarly, each gNB 102-103 could communicate directly with the network 130 and provide UEs with direct wireless broadband access to the network 130. Further, the gNBs 101, 102, and/or 103 could provide access to other or additional external networks, such as external telephone networks or other types of data networks.

FIG. 2 illustrates an example gNB 102 according to embodiments of the present disclosure. The embodiment of the gNB 102 illustrated in FIG. 2 is for illustration only, and the gNBs 101 and 103 of FIG. 1 could have the same or similar configuration. However, gNBs come in a wide variety of configurations, and FIG. 2 does not limit the scope of this disclosure to any particular implementation of a gNB.

As shown in FIG. 2 , the gNB 102 includes multiple antennas 205 a-205 n, multiple RF transceivers 210 a-210 n, transmit (TX) processing circuitry 215, and receive (RX) processing circuitry 220. The gNB 102 also includes a controller/processor 225, a memory 230, and a backhaul or network interface 235.

The RF transceivers 210 a-210 n receive, from the antennas 205 a-205 n, incoming RF signals, such as signals transmitted by UEs in the network 100. The RF transceivers 210 a-210 n down-convert the incoming RF signals to generate IF or baseband signals. The IF or baseband signals are sent to the RX processing circuitry 220, which generates processed baseband signals by filtering, decoding, and/or digitizing the baseband or IF signals. The RX processing circuitry 220 transmits the processed baseband signals to the controller/processor 225 for further processing.

The TX processing circuitry 215 receives analog or digital data (such as voice data, web data, e-mail, or interactive video game data) from the controller/processor 225. The TX processing circuitry 215 encodes, multiplexes, and/or digitizes the outgoing baseband data to generate processed baseband or IF signals. The RF transceivers 210 a-210 n receive the outgoing processed baseband or IF signals from the TX processing circuitry 215 and up-converts the baseband or IF signals to RF signals that are transmitted via the antennas 205 a-205 n.

The controller/processor 225 can include one or more processors or other processing devices that control the overall operation of the gNB 102. For example, the controller/processor 225 could control the reception of forward channel signals and the transmission of reverse channel signals by the RF transceivers 210 a-210 n, the RX processing circuitry 220, and the TX processing circuitry 215 in accordance with well-known principles. The controller/processor 225 could support additional functions as well, such as more advanced wireless communication functions.

For instance, the controller/processor 225 could support beam forming or directional routing operations in which outgoing signals from multiple antennas 205 a-205 n are weighted differently to effectively steer the outgoing signals in a desired direction. Any of a wide variety of other functions could be supported in the gNB 102 by the controller/processor 225.

The controller/processor 225 is also capable of executing programs and other processes resident in the memory 230, such as an OS. The controller/processor 225 can move data into or out of the memory 230 as required by an executing process.

The controller/processor 225 is also coupled to the backhaul or network interface 235. The backhaul or network interface 235 allows the gNB 102 to communicate with other devices or systems over a backhaul connection or over a network. The interface 235 could support communications over any suitable wired or wireless connection(s). For example, when the gNB 102 is implemented as part of a cellular communication system (such as one supporting 5G, LTE, or LTE-A), the interface 235 could allow the gNB 102 to communicate with other gNBs over a wired or wireless backhaul connection. When the gNB 102 is implemented as an access point, the interface 235 could allow the gNB 102 to communicate over a wired or wireless local area network or over a wired or wireless connection to a larger network (such as the Internet). The interface 235 includes any suitable structure supporting communications over a wired or wireless connection, such as an Ethernet or RF transceiver.

The memory 230 is coupled to the controller/processor 225. Part of the memory 230 could include a RAM, and another part of the memory 230 could include a Flash memory or other ROM.

Although FIG. 2 illustrates one example of gNB 102, various changes may be made to FIG. 2 . For example, the gNB 102 could include any number of each component shown in FIG. 2 . As a particular example, an access point could include a number of interfaces 235, and the controller/processor 225 could support routing functions to route data between different network addresses. As another particular example, while shown as including a single instance of TX processing circuitry 215 and a single instance of RX processing circuitry 220, the gNB 102 could include multiple instances of each (such as one per RF transceiver). Also, various components in FIG. 2 could be combined, further subdivided, or omitted and additional components could be added according to particular needs.

FIG. 3 illustrates an example UE 116 according to embodiments of the present disclosure. The embodiment of the UE 116 illustrated in FIG. 3 is for illustration only, and the UEs 111-115 of FIG. 1 could have the same or similar configuration. However, UEs come in a wide variety of configurations, and FIG. 3 does not limit the scope of this disclosure to any particular implementation of a UE.

As shown in FIG. 3 , the UE 116 includes an antenna 305, a radio frequency (RF) transceiver 310, TX processing circuitry 315, a microphone 320, and receive (RX) processing circuitry 325. The UE 116 also includes a speaker 330, a processor 340, an input/output (I/O) interface (IF) 345, a touchscreen 350, a display 355, and a memory 360. The memory 360 includes an operating system (OS) 361 and one or more applications 362.

The RF transceiver 310 receives, from the antenna 305, an incoming RF signal transmitted by a gNB of the network 100. The RF transceiver 310 down-converts the incoming RF signal to generate an intermediate frequency (IF) or baseband signal. The IF or baseband signal is sent to the RX processing circuitry 325, which generates a processed baseband signal by filtering, decoding, and/or digitizing the baseband or IF signal. The RX processing circuitry 325 transmits the processed baseband signal to the speaker 330 (such as for voice data) or to the processor 340 for further processing (such as for web browsing data).

The TX processing circuitry 315 receives analog or digital voice data from the microphone 320 or other outgoing baseband data (such as web data, e-mail, or interactive video game data) from the processor 340. The TX processing circuitry 315 encodes, multiplexes, and/or digitizes the outgoing baseband data to generate a processed baseband or IF signal. The RF transceiver 310 receives the outgoing processed baseband or IF signal from the TX processing circuitry 315 and up-converts the baseband or IF signal to an RF signal that is transmitted via the antenna 305.

The processor 340 can include one or more processors or other processing devices and execute the OS 361 stored in the memory 360 in order to control the overall operation of the UE 116. For example, the processor 340 could control the reception of forward channel signals and the transmission of reverse channel signals by the RF transceiver 310, the RX processing circuitry 325, and the TX processing circuitry 315 in accordance with well-known principles. In some embodiments, the processor 340 includes at least one microprocessor or microcontroller.

The processor 340 is also capable of executing other processes and programs resident in the memory 360, such as processes for determining a CSI report comprising a first CSI part and a second CSI part, the second CSI part including a precoding matrix indicator (PMI), the PMI comprising a plurality of PMI components, wherein some of the PMI components comprise sub-components, for determining priority values for sub-components of some PMI components, and partitioning the second CSI part into Group 0, Group 1, and Group 2 such that the sub-components of the some of the plurality of PMI components are divided into Group 1 and Group 2 based on their determined priority values. The processor 340 can move data into or out of the memory 360 as required by an executing process. In some embodiments, the processor 340 is configured to execute the applications 362 based on the OS 361 or in response to signals received from gNBs or an operator. The processor 340 is also coupled to the I/O interface 345, which provides the UE 116 with the ability to connect to other devices, such as laptop computers and handheld computers. The I/O interface 345 is the communication path between these accessories and the processor 340.

The processor 340 is also coupled to the touchscreen 350 and the display 355. The operator of the UE 116 can use the touchscreen 350 to enter data into the UE 116. The display 355 may be a liquid crystal display, light emitting diode display, or other display capable of rendering text and/or at least limited graphics, such as from web sites.

The memory 360 is coupled to the processor 340. Part of the memory 360 could include a random access memory (RAM), and another part of the memory 360 could include a Flash memory or other read-only memory (ROM).

Although FIG. 3 illustrates one example of UE 116, various changes may be made to FIG. 3 . For example, various components in FIG. 3 could be combined, further subdivided, or omitted and additional components could be added according to particular needs. As a particular example, the processor 340 could be divided into multiple processors, such as one or more central processing units (CPUs) and one or more graphics processing units (GPUs). Also, while FIG. 3 illustrates the UE 116 configured as a mobile telephone or smartphone, UEs could be configured to operate as other types of mobile or stationary devices.

FIG. 4A is a high-level diagram of transmit path circuitry. For example, the transmit path circuitry may be used for an orthogonal frequency division multiple access (OFDMA) communication. FIG. 4B is a high-level diagram of receive path circuitry. For example, the receive path circuitry may be used for an orthogonal frequency division multiple access (OFDMA) communication. In FIGS. 4A and 4B, for downlink communication, the transmit path circuitry may be implemented in a base station (gNB) 102 or a relay station, and the receive path circuitry may be implemented in a user equipment (e.g., user equipment 116 of FIG. 1 ). In other examples, for uplink communication, the receive path circuitry 450 may be implemented in a base station (e.g., gNB 102 of FIG. 1 ) or a relay station, and the transmit path circuitry may be implemented in a user equipment (e.g., user equipment 116 of FIG. 1 ).

Transmit path circuitry comprises channel coding and modulation block 405, serial-to-parallel (S-to-P) block 410, Size N Inverse Fast Fourier Transform (IFFT) block 415, parallel-to-serial (P-to-S) block 420, add cyclic prefix block 425, and up-converter (UC) 430. Receive path circuitry 450 comprises down-converter (DC) 455, remove cyclic prefix block 460, serial-to-parallel (S-to-P) block 465, Size N Fast Fourier Transform (FFT) block 470, parallel-to-serial (P-to-S) block 475, and channel decoding and demodulation block 480.

At least some of the components in FIGS. 4A 400 and 4B 450 may be implemented in software, while other components may be implemented by configurable hardware or a mixture of software and configurable hardware. In particular, it is noted that the FFT blocks and the IFFT blocks described in this disclosure document may be implemented as configurable software algorithms, where the value of Size N may be modified according to the implementation.

Furthermore, although this disclosure is directed to an embodiment that implements the Fast Fourier Transform and the Inverse Fast Fourier Transform, this is by way of illustration only and may not be construed to limit the scope of the disclosure. It may be appreciated that in an alternate embodiment of the present disclosure, the Fast Fourier Transform functions and the Inverse Fast Fourier Transform functions may easily be replaced by discrete Fourier transform (DFT) functions and inverse discrete Fourier transform (IDFT) functions, respectively. It may be appreciated that for DFT and IDFT functions, the value of the N variable may be any integer number (i.e., 1, 4, 3, 4, etc.), while for FFT and IFFT functions, the value of the N variable may be any integer number that is a power of two (i.e., 1, 2, 4, 8, 16, etc.).

In transmit path circuitry 400, channel coding and modulation block 405 receives a set of information bits, applies coding (e.g., LDPC coding) and modulates (e.g., quadrature phase shift keying (QPSK) or quadrature amplitude modulation (QAM)) the input bits to produce a sequence of frequency-domain modulation symbols. Serial-to-parallel block 410 converts (i.e., de-multiplexes) the serial modulated symbols to parallel data to produce N parallel symbol streams where N is the IFFT/FFT size used in BS 102 and UE 116. Size N IFFT block 415 then performs an IFFT operation on the N parallel symbol streams to produce time-domain output signals. Parallel-to-serial block 420 converts (i.e., multiplexes) the parallel time-domain output symbols from Size N IFFT block 415 to produce a serial time-domain signal. Add cyclic prefix block 425 then inserts a cyclic prefix to the time-domain signal. Finally, up-converter 430 modulates (i.e., up-converts) the output of add cyclic prefix block 425 to RF frequency for transmission via a wireless channel. The signal may also be filtered at baseband before conversion to RF frequency.

The transmitted RF signal arrives at the UE 116 after passing through the wireless channel, and reverse operations to those at gNB 102 are performed. Down-converter 455 down-converts the received signal to baseband frequency, and remove cyclic prefix block 460 removes the cyclic prefix to produce the serial time-domain baseband signal. Serial-to-parallel block 465 converts the time-domain baseband signal to parallel time-domain signals. Size N FFT block 470 then performs an FFT algorithm to produce N parallel frequency-domain signals. Parallel-to-serial block 475 converts the parallel frequency-domain signals to a sequence of modulated data symbols. Channel decoding and demodulation block 480 demodulates and then decodes the modulated symbols to recover the original input data stream.

Each of gNBs 101-103 may implement a transmit path that is analogous to transmitting in the downlink to user equipment 111-116 and may implement a receive path that is analogous to receiving in the uplink from user equipment 111-116. Similarly, each one of user equipment 111-116 may implement a transmit path corresponding to the architecture for transmitting in the uplink to gNBs 101-103 and may implement a receive path corresponding to the architecture for receiving in the downlink from gNBs 101-103.

5G communication system use cases have been identified and described. Those use cases can be roughly categorized into three different groups. In one example, enhanced mobile broadband (eMBB) is determined to do with high bits/sec requirement, with less stringent latency and reliability requirements. In another example, ultra reliable and low latency (URLL) is determined with less stringent bits/sec requirement. In yet another example, massive machine type communication (mMTC) is determined that a number of devices can be as many as 100,000 to 1 million per km2, but the reliability/throughput/latency requirement could be less stringent. This scenario may also involve power efficiency requirement as well, in that the battery consumption may be minimized as possible.

A communication system includes a downlink (DL) that conveys signals from transmission points such as base stations (BSs) or NodeBs to user equipments (UEs) and an Uplink (UL) that conveys signals from UEs to reception points such as NodeBs. A UE, also commonly referred to as a terminal or a mobile station, may be fixed or mobile and may be a cellular phone, a personal computer device, or an automated device. An eNodeB, which is generally a fixed station, may also be referred to as an access point or other equivalent terminology. For LTE systems, a NodeB is often referred as an eNodeB.

In a communication system, such as LTE system, DL signals can include data signals conveying information content, control signals conveying DL control information (DCI), and reference signals (RS) that are also known as pilot signals. An eNodeB transmits data information through a physical DL shared channel (PDSCH). An eNodeB transmits DCI through a physical DL control channel (PDCCH) or an Enhanced PDCCH (EPDCCH).

An eNodeB transmits acknowledgement information in response to data transport block (TB) transmission from a UE in a physical hybrid ARQ indicator channel (PHICH). An eNodeB transmits one or more of multiple types of RS including a UE-common RS (CRS), a channel state information RS (CSI-RS), or a demodulation RS (DMRS). A CRS is transmitted over a DL system bandwidth (BW) and can be used by UEs to obtain a channel estimate to demodulate data or control information or to perform measurements. To reduce CRS overhead, an eNodeB may transmit a CSI-RS with a smaller density in the time and/or frequency domain than a CRS. DMRS can be transmitted only in the BW of a respective PDSCH or EPDCCH and a UE can use the DMRS to demodulate data or control information in a PDSCH or an EPDCCH, respectively. A transmission time interval for DL channels is referred to as a subframe and can have, for example, duration of 1 millisecond.

DL signals also include transmission of a logical channel that carries system control information. A BCCH is mapped to either a transport channel referred to as a broadcast channel (BCH) when the DL signals convey a master information block (MIB) or to a DL shared channel (DL-SCH) when the DL signals convey a System Information Block (SIB). Most system information is included in different SIBs that are transmitted using DL-SCH. A presence of system information on a DL-SCH in a subframe can be indicated by a transmission of a corresponding PDCCH conveying a codeword with a cyclic redundancy check (CRC) scrambled with system information RNTI (SI-RNTI). Alternatively, scheduling information for a SIB transmission can be provided in an earlier SIB and scheduling information for the first SIB (SIB-1) can be provided by the MIB.

DL resource allocation is performed in a unit of subframe and a group of physical resource blocks (PRBs). A transmission BW includes frequency resource units referred to as resource blocks (RBs). Each RB includes N_(sc) ^(RB) sub-carriers, or resource elements (REs), such as 12 REs. A unit of one RB over one subframe is referred to as a PRB. A UE can be allocated M_(PDSCH) RBs for a total of M_(sc) ^(PDSCH)=M_(PDSCH)·N_(sc) ^(RB) REs for the PDSCH transmission BW.

UL signals can include data signals conveying data information, control signals conveying UL control information (UCI), and UL RS. UL RS includes DMRS and Sounding RS (SRS). A UE transmits DMRS only in a BW of a respective PUSCH or PUCCH. An eNodeB can use a DMRS to demodulate data signals or UCI signals. A UE transmits SRS to provide an eNodeB with an UL CSI. A UE transmits data information or UCI through a respective physical UL shared channel (PUSCH) or a Physical UL control channel (PUCCH). If a UE needs to transmit data information and UCI in a same UL subframe, the UE may multiplex both in a PUSCH. UCI includes Hybrid Automatic Repeat request acknowledgement (HARQ-ACK) information, indicating correct (ACK) or incorrect (NACK) detection for a data TB in a PDSCH or absence of a PDCCH detection (DTX), scheduling request (SR) indicating whether a UE has data in the UE's buffer, rank indicator (RI), and channel state information (CSI) enabling an eNodeB to perform link adaptation for PDSCH transmissions to a UE. HARQ-ACK information is also transmitted by a UE in response to a detection of a PDCCH/EPDCCH indicating a release of semi-persistently scheduled PDSCH.

An UL subframe includes two slots. Each slot includes N_(symb) ^(UL) symbols for transmitting data information, UCI, DMRS, or SRS. A frequency resource unit of an UL system BW is a RB. A UE is allocated N_(RB) RBs for a total of N_(R)·N_(sc) ^(RB) REs for a transmission BW. For a PUCCH, N_(RB)=1. A last subframe symbol can be used to multiplex SRS transmissions from one or more UEs. A number of subframe symbols that are available for data/UCI/DMRS transmission is N_(symb)=2·(N_(symb) ^(UL)−1)−N_(SRS), where N_(SRS)=1 if a last subframe symbol is used to transmit SRS and N_(SRS)=0 otherwise.

FIG. 5 illustrates an example transmitter block diagram 500 for a PDSCH in a subframe according to embodiments of the present disclosure. The embodiment of the block diagram of the transmitter 500 illustrated in FIG. 5 is for illustration only. One or more of the components illustrated in FIG. 5 can be implemented in specialized circuitry configured to perform the noted functions or one or more of the components can be implemented by one or more processors executing instructions to perform the noted functions. FIG. 5 does not limit the scope of this disclosure to any particular implementation of the diagram 500.

As shown in FIG. 5 , information bits 510 are encoded by encoder 520, such as a turbo encoder, and modulated by modulator 530, for example using quadrature phase shift keying (QPSK) modulation. A serial to parallel (S/P) converter 540 generates M modulation symbols that are subsequently provided to a mapper 550 to be mapped to REs selected by a transmission BW selection unit 555 for an assigned PDSCH transmission BW, unit 560 applies an Inverse fast Fourier transform (IFFT), the output is then serialized by a parallel to serial (P/S) converter 570 to create a time domain signal, filtering is applied by filter 580, and a signal transmitted 590. Additional functionalities, such as data scrambling, cyclic prefix insertion, time windowing, interleaving, and others are well known in the art and are not shown for brevity.

FIG. 6 illustrates a receiver block diagram 600 for a PDSCH in a subframe according to embodiments of the present disclosure. The embodiment of the diagram 600 illustrated in FIG. 6 is for illustration only. One or more of the components illustrated in FIG. 6 can be implemented in specialized circuitry configured to perform the noted functions or one or more of the components can be implemented by one or more processors executing instructions to perform the noted functions. FIG. 6 does not limit the scope of this disclosure to any particular implementation of the diagram 600.

As shown in FIG. 6 , a received signal 610 is filtered by filter 620, REs 630 for an assigned reception BW are selected by BW selector 635, unit 640 applies a fast Fourier transform (FFT), and an output is serialized by a parallel-to-serial converter 650. Subsequently, a demodulator 660 coherently demodulates data symbols by applying a channel estimate obtained from a DMRS or a CRS (not shown), and a decoder 670, such as a turbo decoder, decodes the demodulated data to provide an estimate of the information data bits 680. Additional functionalities such as time-windowing, cyclic prefix removal, de-scrambling, channel estimation, and de-interleaving are not shown for brevity.

FIG. 7 illustrates a transmitter block diagram 700 for a PUSCH in a subframe according to embodiments of the present disclosure. The embodiment of the block diagram 700 illustrated in FIG. 7 is for illustration only. One or more of the components illustrated in FIG. 4A can be implemented in specialized circuitry configured to perform the noted functions or one or more of the components can be implemented by one or more processors executing instructions to perform the noted functions. FIG. 7 does not limit the scope of this disclosure to any particular implementation of the diagram 700.

As shown in FIG. 7 , information data bits 710 are encoded by encoder 720, such as a turbo encoder, and modulated by modulator 730. A discrete Fourier transform (DFT) unit 740 applies a DFT on the modulated data bits, REs 750 corresponding to an assigned PUSCH transmission BW are selected by transmission BW selection unit 755, unit 760 applies an IFFT and, after a cyclic prefix insertion (not shown), filtering is applied by filter 770 and a signal transmitted 780.

FIG. 8 illustrates a receiver block diagram 800 for a PUSCH in a subframe according to embodiments of the present disclosure. The embodiment of the block diagram 800 illustrated in FIG. 8 is for illustration only. One or more of the components illustrated in FIG. 8 can be implemented in specialized circuitry configured to perform the noted functions or one or more of the components can be implemented by one or more processors executing instructions to perform the noted functions. FIG. 8 does not limit the scope of this disclosure to any particular implementation of the diagram 800.

As shown in FIG. 8 , a received signal 810 is filtered by filter 820. Subsequently, after a cyclic prefix is removed (not shown), unit 830 applies a FFT, REs 840 corresponding to an assigned PUSCH reception BW are selected by a reception BW selector 845, unit 850 applies an inverse DFT (IDFT), a demodulator 860 coherently demodulates data symbols by applying a channel estimate obtained from a DMRS (not shown), a decoder 870, such as a turbo decoder, decodes the demodulated data to provide an estimate of the information data bits 880.

In next generation cellular systems, various use cases are envisioned beyond the capabilities of LTE system. Termed 5G or the fifth generation cellular system, a system capable of operating at sub-6 GHz and above-6 GHz (for example, in mmWave regime) becomes one of the requirements. In 3GPP TR 22.891, 74 5G use cases has been identified and described; those use cases can be roughly categorized into three different groups. A first group is termed “enhanced mobile broadband (eMBB),” targeted to high data rate services with less stringent latency and reliability requirements. A second group is termed “ultra-reliable and low latency (URLL)” targeted for applications with less stringent data rate requirements, but less tolerant to latency. A third group is termed “massive MTC (mMTC)” targeted for large number of low-power device connections such as 1 million per km² with less stringent the reliability, data rate, and latency requirements.

In order for the 5G network to support such diverse services with different quality of services (QoS), one method has been identified in 3GPP specification, called network slicing. To utilize PHY resources efficiently and multiplex various slices (with different resource allocation schemes, numerologies, and scheduling strategies) in DL-SCH, a flexible and self-contained frame or subframe design is utilized.

FIG. 9 illustrates an example multiplexing of two slices 900 according to embodiments of the present disclosure. The embodiment of the multiplexing of two slices 900 illustrated in FIG. 9 is for illustration only. One or more of the components illustrated in FIG. 9 can be implemented in specialized circuitry configured to perform the noted functions or one or more of the components can be implemented by one or more processors executing instructions to perform the noted functions. FIG. 9 does not limit the scope of this disclosure to any particular implementation of the multiplexing of two slices 900.

Two exemplary instances of multiplexing two slices within a common subframe or frame are depicted in FIG. 9 . In these exemplary embodiments, a slice can be composed of one or two transmission instances where one transmission instance includes a control (CTRL) component (e.g., 920 a, 960 a, 960 b, 920 b, or 960 c) and a data component (e.g., 930 a, 970 a, 970 b, 930 b, or 970 c). In embodiment 910, the two slices are multiplexed in frequency domain whereas in embodiment 950, the two slices are multiplexed in time domain. These two slices can be transmitted with different sets of numerology.

3GPP specification supports up to 32 CSI-RS antenna ports which enable a gNB to be equipped with a large number of antenna elements (such as 64 or 128). In this case, a plurality of antenna elements is mapped onto one CSI-RS port. For next generation cellular systems such as 5G, the maximum number of CSI-RS ports can either remain the same or increase.

FIG. 10 illustrates an example antenna blocks 1000 according to embodiments of the present disclosure. The embodiment of the antenna blocks 1000 illustrated in FIG. 10 is for illustration only. FIG. 10 does not limit the scope of this disclosure to any particular implementation of the antenna blocks 1000.

For mmWave bands, although the number of antenna elements can be larger for a given form factor, the number of CSI-RS ports—which can correspond to the number of digitally precoded ports—tends to be limited due to hardware constraints (such as the feasibility to install a large number of ADCs/DACs at mmWave frequencies) as illustrated in FIG. 10 . In this case, one CSI-RS port is mapped onto a large number of antenna elements which can be controlled by a bank of analog phase shifters. One CSI-RS port can then correspond to one sub-array which produces a narrow analog beam through analog beamforming. The analog beam can be configured to sweep across a wider range of angles by varying the phase shifter bank across symbols or subframes. A number of sub-arrays (equal to the number of RF chains) is the same as the number of CSI-RS ports N_(CSI_PORT). A digital beamforming unit performs a linear combination across N_(CSI_PORT) analog beams to further increase precoding gain. While analog beams are wideband (hence not frequency-selective), digital precoding can be varied across frequency sub-bands or resource blocks.

All the following components and embodiments are applicable for UL transmission with CP-OFDM (cyclic prefix OFDM) waveform as well as DFT-SOFDM (DFT-spread OFDM) and SC-FDMA (single-carrier FDMA) waveforms. Furthermore, all the following components and embodiments are applicable for UL transmission when the scheduling unit in time is either one subframe (which can consist of one or multiple slots) or one slot.

In the present disclosure, the frequency resolution (reporting granularity) and span (reporting bandwidth) of CSI reporting can be defined in terms of frequency “subbands” and “CSI reporting band” (CRB), respectively.

A subband for CSI reporting is defined as a set of contiguous PRBs which represents the smallest frequency unit for CSI reporting. The number of PRBs in a subband can be fixed for a given value of DL system bandwidth, configured either semi-statically via higher-layer/RRC signaling, or dynamically via L1 DL control signaling or MAC control element (MAC CE). The number of PRBs in a subband can be included in CSI reporting setting.

“CSI reporting band” is defined as a set/collection of subbands, either contiguous or non-contiguous, wherein CSI reporting is performed. For example, CSI reporting band can include all the subbands within the DL system bandwidth. This can also be termed “full-band”. Alternatively, CSI reporting band can include only a collection of subbands within the DL system bandwidth. This can also be termed “partial band”.

The term “CSI reporting band” is used only as an example for representing a function. Other terms such as “CSI reporting subband set” or “CSI reporting bandwidth” can also be used.

In terms of UE configuration, a UE can be configured with at least one CSI reporting band. This configuration can be semi-static (via higher-layer signaling or RRC) or dynamic (via MAC CE or L1 DL control signaling). When configured with multiple (N) CSI reporting bands (e.g., via RRC signaling), a UE can report CSI associated with n≤N CSI reporting bands. For instance, >6 GHz, large system bandwidth may require multiple CSI reporting bands. The value of n can either be configured semi-statically (via higher-layer signaling or RRC) or dynamically (via MAC CE or L1 DL control signaling). Alternatively, the UE can report a recommended value of n via an UL channel.

Therefore, CSI parameter frequency granularity can be defined per CSI reporting band as follows. A CSI parameter is configured with “single” reporting for the CSI reporting band with M_(n) subbands when one CSI parameter for all the M_(n) subbands within the CSI reporting band. A CSI parameter is configured with “subband” for the CSI reporting band with M_(n) subbands when one CSI parameter is reported for each of the M_(n) subbands within the CSI reporting band.

FIG. 11 illustrates an example antenna port layout 1100 according to embodiments of the present disclosure. The embodiment of the antenna port layout 1100 illustrated in FIG. 11 is for illustration only. FIG. 11 does not limit the scope of this disclosure to any particular implementation of the antenna port layout 1100.

As illustrated in FIG. 11 , N₁ and N₂ are the number of antenna ports with the same polarization in the first and second dimensions, respectively. For 2D antenna port layouts, N₁>1, N₂>1, and for 1D antenna port layouts N₁>1 and N₂=1. So, for a dual-polarized antenna port layout, the total number of antenna ports is 2N₁N₂.

In the 3GPP NR specification, when the UE is configured with higher layer parameter codebookType set to ‘typeII’ or ‘typeII-PortSelection’, each PMI value corresponds to the codebook indices i₁ and i₂. When codebookType=‘typeII’, the first PMI i₁ comprises two layer-common (i.e., reported common for two layers if the UE reports RI=2) components indicating

-   -   an orthogonal basis set comprising N₁N₂ orthogonal discrete         Fourier transform (DFT) beams/vectors (indicated using indicator         i_(1,1) indicating the rotation factors (q₁, q₂)) and     -   L out of N₁N₂ beam/vector selection (indicated using indicator         i_(1,2)), and two layer-specific (i.e., reported for each of the         two layers if the UE reports RI=2) components indicating         -   a strongest coefficient (indicated using indicators             i_(1,3,1) and i_(1,3,2)) and         -   a WB amplitude coefficient p_(l,i) ⁽¹⁾ (indicated using             indicators i_(1,4,1) and i_(1,4,2)).

When codebookType=‘typeII-PortSelection’, the first PMI i₁ comprises a layer-common (i.e., reported common for two layers if UE reports RI=2) component indicating L out of P_(CSI-RS)/2 port selection (indicated using indicator i_(1,1)).

The values of N₁ and N₂ are configured with the higher layer parameter n1-n2-codebookSubsetRestriction. The supported configurations of (N₁, N₂) for a given number of CSI-RS ports and the corresponding values of (O₁, O₂) are given. The number of CSI-RS ports is 2N₁N₂. The number of CSI-RS ports is given by P_(CSI-RS)ϵ{4, 8, 12, 16, 24, 32} as configured by higher layer parameter nrofPorts. The value of L is configured with the higher layer parameter numberOfBeams.

The first PMI i₁ is given by

$i_{1} = \left\{ {{\begin{matrix} {{\left\lbrack {i_{1,1}\ i_{1,2}\ i_{1,3,1}\ i_{1,4,1}} \right\rbrack\ v} = 1} \\ {{\left\lbrack {i_{1,1}\ i_{1,2}\ i_{1,3,1}\ i_{1,4,1}\ i_{1,3,2}\ i_{1,4,2}} \right\rbrack\ v} = 2} \end{matrix}{if}\ {codebookType}\ {set}\ {{to}\ '}{type}{{II}'} i_{1}} = \left\{ {\begin{matrix} {{\left\lbrack {i_{1,1}\ i_{1,3,1}\ i_{1,4,1}} \right\rbrack\ v} = 1} \\ {{\left\lbrack {i_{1,1}\ i_{1,3,1}\ i_{1,4,1}\ i_{1,3,2}\ i_{1,4,2}} \right\rbrack\ v} = 2} \end{matrix}{if}{codebookType}\ {set}\ {to}\ \text{" type II‐PortSelection'.}} \right.} \right.$

The second PMI

$i_{2} = \left\{ \begin{matrix} \left\lbrack i_{2,1,1} \right\rbrack & {{{subbandAmplitude} = {'{{false}'}}},{v = 1}} \\ \left\lbrack {i_{2,1,1}i_{2,1,2}} \right\rbrack & {{{subbandAmplitude} = {'{{false}'}}},{v = 2}} \\ \left\lbrack {i_{2,1,1}i_{2,2,1}} \right\rbrack & {{{subbandAmplitude} = {'{{true}'}}},{v = 1}} \\ \left\lbrack {i_{2,1,1}i_{2,2,1}i_{2,1,2}i_{2,2,2}} \right\rbrack & {{{subbandAmplitude} = {'{{true}'}}},{v = 2}} \end{matrix} \right.$

comprises two layer-specific components indicating

-   -   SB phase coefficient c_(l,i) indicated using indicators         i_(2,1,1) and i_(2,1,2), and     -   SB amplitude coefficient p_(l,i) ⁽²⁾ (which can be turned ON or         OFF by RRC signaling via subbandAmplitude) indicated using         indicators i_(2,2,1) and i_(2,2,2).

The first PMI is reported in a wideband (WB) manner and the second PMI can be reported in a wideband or subband (SB) manner.

FIG. 12 illustrates an example two-part UCI multiplexing process 1200 according to embodiments of the present disclosure, as may be performed by a UE such as UE 116. The embodiment of the two-part UCI multiplexing process 1200 illustrated in FIG. 12 is for illustration only. FIG. 12 does not limit the scope of this disclosure to any particular implementation of the process 1200.

As shown in FIG. 12 , the two-part UCI multiplexing 1200 is used to report Type II CSI on PUSCH (or PUCCH) when codebookType=‘typeII’ or ‘typeII-PortSelection’, wherein

-   -   CQI, RI, and (N_(0,1), N_(0,2)) are multiplexed and encoded         together in part 1, where N_(0,1) and N_(0,2) respectively         indicate the number of reported WB amplitudes that are non-zero         for layer 1 and layer 2 respectively, i.e., p_(l,i) ⁽¹⁾≠0; and     -   Remaining CSI are multiplexed and encoded together in part 2,         where the remaining CSI includes the first PMI i₁ and the second         PMI (i₂). It may also include layer indicator (LI).

The part 1 UCI may also include CRI if the UE is configured with more than one CSI-RS resource. When cqi-FormatIndicator=widebandCQI, then CQI reported in part 1 UCI corresponds to WB CQI, and when cqi-FormatIndicator=subbandCQI, then CQI reported in part UCI corresponds to WB CQI and SB differential CQI, where WB CQI is reported common for all SBs, and SB differential CQI is reported for each SB, and the number of SBs (or the set of SB indices) is configured to the UE.

Based on the value of the reported (N_(0,1), N_(0,2)) in part 1, the CSI reporting payload (bits) for part 2 is determined. In particular, the components of the second PMI i₂ are reported only for the coefficients whose corresponding reported WB amplitudes are non-zero.

As described in U.S. Pat. No. 10,659,118 issued May 19, 2020, and entitled “Method and Apparatus for Explicit CSI Reporting in Advanced Wireless Communication Systems,” which is incorporated herein by reference in its entirety, a UE is configured with high-resolution (e.g., Type II) CSI reporting in which the linear combination based Type II CSI reporting framework is extended to include a frequency dimension in addition to the first and second antenna port dimensions.

FIG. 13 illustrates an example 3D grid 1300 of the oversampled DFT beams (1st port dim., 2nd port dim., freq. dim.) according to embodiments of the present disclosure. The embodiment of the 3D grid 1300 illustrated in FIG. 13 is for illustration only. FIG. 13 does not limit the scope of this disclosure to any particular implementation of the grid 1300.

As shown, FIG. 13 illustrates the 3D grid 1300 of the oversampled DFT beams (1st port dim., 2nd port dim., freq. dim.) in which

-   -   1st dimension is associated with the 1st port dimension,     -   2nd dimension is associated with the 2nd port dimension, and     -   3rd dimension is associated with the frequency dimension.

The basis sets for 1^(st) and 2^(nd) port domain representation are oversampled DFT codebooks of length-N₁ and length-N₂, respectively, and with oversampling factors O₁ and O₂, respectively. Likewise, the basis set for frequency domain representation (i.e., 3rd dimension) is an oversampled DFT codebook of length-N₃ and with oversampling factor O₃. In one example, O₁=O₂=O₃=4. In another example, the oversampling factors O_(i) belongs to {2, 4, 8}. In yet another example, at least one of O₁, O₂, and O₃ is higher layer configured (via RRC signaling).

A UE is configured with higher layer parameter CodebookType set to ‘TypeII-Compression’ or ‘TypeIII’ for an enhanced Type II CSI reporting in which the pre-coders for all SBs and for a given layer l=1, . . . , v, where v is the associated RI value, is given by either

$\begin{matrix} {{W^{l} = {{AC_{l}B^{H}} = {{{\left\lbrack {a_{0}a_{1}\ldots a_{L - 1}} \right\rbrack\begin{bmatrix} c_{l,0,0} & c_{l,0,1} & \ldots & c_{l,0,{M - 1}} \\ c_{l,1,0} & c_{l,1,1} & \ldots & c_{l,1,{M - 1}} \\  \vdots & \vdots & \vdots & \vdots \\ c_{l,{L - 1},0} & c_{l,{L - 1},1} & \ldots & c_{l,{L - 1},{M - 1}} \end{bmatrix}}\left\lbrack {b_{0}b_{1}\ldots b_{M - 1}} \right\rbrack}^{H} = {{\sum\limits_{m = 0}^{M - 1}{\sum\limits_{i = 0}^{L - 1}{c_{l,i,m}\left( {a_{i}b_{m}^{H}} \right)}}} = {\sum\limits_{i = 0}^{L - 1}{\sum\limits_{m = 0}^{M - 1}{c_{l,i,m}\left( {a_{i}b_{m}^{H}} \right)}}}}}}},{or}} & \left( {{Eq}.1} \right) \end{matrix}$ $\begin{matrix} {{{{W^{l} = {{\begin{bmatrix} A & 0 \\ 0 & A \end{bmatrix}\ C_{l}B^{H}} =}}}\left\lbrack \text{⁠}\begin{matrix} {a_{0}a_{1}\ldots a_{L - 1}} & 0 \\ 0 & {a_{0}a_{1}\ldots a_{L - 1}} \end{matrix} \right\rbrack}{{{{\begin{bmatrix} c_{l,0,0} & c_{l,0,1} & \ldots & c_{l,0,{M - 1}} \\ c_{l,1,0} & c_{l,1,1} & \ldots & c_{l,1,{M - 1}} \\  \vdots & \vdots & \vdots & \vdots \\ c_{l,{L - 1},0} & c_{l,{L - 1},1} & \ldots & c_{l,{L - 1},{M - 1}} \end{bmatrix}\text{ }\left\lbrack {b_{0}b_{1}\ldots b_{M - 1}} \right\rbrack}^{H} = \begin{bmatrix} {\sum\limits_{m = 0}^{M - 1}{\sum\limits_{i = 0}^{L - 1}{c_{l,i,m}\left( {a_{i}b_{m}^{H}} \right)}}} \\ {\sum\limits_{m = 0}^{M - 1}{\sum\limits_{i = 0}^{L - 1}{c_{l,{i + L},m}\left( {a_{i}b_{m}^{H}} \right)}}} \end{bmatrix}},}}} & \left( {{Eq}.2} \right) \end{matrix}$

where

-   -   N₁ is a number of antenna ports in a first antenna port         dimension,     -   N₂ is a number of antenna ports in a second antenna port         dimension,     -   N₃ is a number of SBs or frequency domain (FD) units/components         for PMI reporting (that comprise the CSI reporting band), which         can be different (e.g., less than) from a number of SBs for CQI         reporting.     -   a_(i) is a 2N₁N₂×1 (Eq. 1) or N₁N₂×1 (Eq. 2) column vector,     -   b_(k) is a N₃×1 column vector,     -   c_(l,i,m) is a complex coefficient.

In the rest of the disclosure, the terms “SB for PMI reporting” and “FD unit for PMI reporting” are used inter-changeably since they are equivalent.

In a variation, when a subset K<2LM coefficients (where K is either fixed, configured by the gNB or reported by the UE), then the coefficient c_(l,i,m) in precoder equations Eq. 1 or Eq. 2 is replaced with v_(l,i,m)×c_(l,i,m), where:

-   -   v_(l,i,m)=1 if the coefficient is reported by the UE according         to some embodiments of this disclosure.     -   v_(l,i,m)=0 otherwise (i.e., c_(l,i,m) is not reported by the         UE).         The indication whether v_(l,i,m)=1 or 0 is according to some         embodiments of this disclosure.

In a variation, the precoder equations Eq. 1 or Eq. 2 are respectively generalized to

$\begin{matrix} {{W^{l} = {\sum\limits_{i = 0}^{L - 1}{\sum\limits_{m = 0}^{M_{i} - 1}{c_{l,i,m}\left( {a_{i}b_{i,m}^{H}} \right)}}}}{and}} & \left( {{Eq}.3} \right) \end{matrix}$ $\begin{matrix} {{W^{l} = \begin{bmatrix} {\sum\limits_{i = 0}^{L - 1}{\sum\limits_{m = 0}^{M_{i} - 1}{c_{l,i,m}\left( {a_{i}b_{i,m}^{H}} \right)}}} \\ {\sum\limits_{i = 0}^{L - 1}{\sum\limits_{m = 0}^{M_{i} - 1}{c_{l,{i + L},m}\left( {a_{i}b_{i,m}^{H}} \right)}}} \end{bmatrix}},} & \left( {{Eq}.4} \right) \end{matrix}$

where for a given i, the number of basis vectors is M_(i) and the corresponding basis vectors are {b_(i,m)}. Note that M_(i) is the number of coefficients c_(l,i,m) reported by the UE for a given i, where M_(i)≤M (where {M_(i)} or ΣM_(i) is either fixed, configured by the gNB or reported by the UE).

The columns of W^(l) are normalized to norm one. For rank R or R layers (v=R), the pre-coding matrix is given by

$W^{(R)} = {{\frac{1}{\sqrt{R}}\left\lbrack {W^{1}\ W^{2}\ \ldots W^{R}} \right\rbrack}.}$

Eq. 2 is assumed in the rest of the disclosure. The embodiments of the disclosure, however, are general and are also applicable to Eq. 1, Eq. 3 and Eq. 4.

Here L≤2N₁N₂ and K≤N₃. If L=2N₁N₂, then A is an identity matrix, and hence not reported. Likewise, if K=N₃, then B is an identity matrix, and hence not reported. Assuming L<2N₁N₂, in an example, to report columns of A, the oversampled DFT codebook is used. For instance, a_(i)=v_(l,m), where the quantity v_(l,m) is given by:

$u_{m} = \left\{ {{\begin{matrix} \left\lbrack {1e^{j\frac{2\pi m}{O_{2}N_{2}}}\ \ldots e^{j\frac{2\pi{m({N_{2} - 1})}}{O_{2}N_{2}}}} \right\rbrack & {N_{2} > 1} \\ 1 & {N_{2} = {1.}} \end{matrix} v_{l,m}} = {\left\lbrack {u_{m}e^{j\frac{2\pi l}{O_{1}N_{1}}}u_{m}\ \ldots e^{j\frac{2\pi{l({N_{1} - 1})}}{O_{1}N_{1}}}u_{m}} \right\rbrack^{T}.}} \right.$

Similarly, assuming K<N₃, in an example, to report columns of B, the oversampled DFT codebook is used. For instance, b_(k)=w_(k), where the quantity w_(k) is given by:

$w_{k} = {\left\lbrack {1e^{j\frac{2\pi k}{O_{3}N_{3}}}\ldots e^{j\frac{2\pi{k({N_{3} - 1})}}{O_{3}N_{3}}}} \right\rbrack.}$

In another example, discrete cosine transform DCT basis is used to construct/report basis B for the 3^(rd) dimension. The m-th column of the DCT compression matrix is simply given by

$\left\lbrack W_{f} \right\rbrack_{nm} = \left\{ {\begin{matrix} {\frac{1}{\sqrt{K}},{n = 0}} \\ {{\sqrt{\frac{2}{K}}\cos\frac{{\pi\left( {{2m} + 1} \right)}n}{2K}},\ {n = 1},{{\ldots\ K} - 1^{\prime}}} \end{matrix},{{{and}K} = N_{3}},{{{and}m} = 0},{{\ldots N_{3}} - {1.}}} \right.$

Since DCT is applied to real valued coefficients, the DCT is applied to the real and imaginary components (of the channel or channel eigenvectors) separately. Alternatively, the DCT is applied to the magnitude and phase components (of the channel or channel eigenvectors) separately. The use of DFT or DCT basis is for illustration purpose only. The disclosure is applicable to any other basis vectors to construct/report A and B.

Also, in an alternative, for reciprocity-based Type II CSI reporting, a UE is configured with higher layer parameter CodebookType set to ‘TypeII-PortSelection-Compression’ or ‘TypeIII-PortSelection’ for an enhanced Type II CSI reporting with port selection in which the pre-coders for all SBs and for a given layer l=1, . . . , v, where v is the associated RI value, is given by W^(l)=AC_(l)B^(H), where N₁, N₂, N₃, and are defined as above except that the matrix A comprises port selection vectors. For instance, the L antenna ports per polarization or column vectors of A are selected by the index q₁, where

$q_{1} \in \left\{ {0,1,\ldots,{\left\lceil \frac{P_{{CSI}‐{RS}}}{2d} \right\rceil - 1}} \right\}$

(this requires

$\left\lceil {\log_{2}\left\lceil \frac{P_{{CSI}‐{RS}}}{2d} \right\rceil} \right\rceil$

bits), and the value of d is configured with the higher layer parameter PortSelectionSamplingSize, where

$d \in {{\left\{ {1,2,3,4} \right\}{and}d} \leq {{\min\left( {\frac{P_{{CSI}‐{RS}}}{2},\ L} \right)}.}}$

To report columns of A, the port selection vectors are used, For instance, a_(i)=v_(m), where the quantity v_(m), is a P_(CSI-RS)/2-element column vector containing a value of 1 in element (m mod P_(CSI-RS)/2) and zeros elsewhere (where the first element is element 0).

On a high level, a precoder W^(l) can be described as follows.

W ^(l) =AC _(l) B ^(H) =W ₁ {tilde over (W)} ₂ W _(f) ^(H),  (5)

where A=W₁ corresponds to the W₁ in Type II CSI codebook, i.e.,

$W_{1} = {{\begin{bmatrix} A & 0 \\ 0 & A \end{bmatrix}{and}B} = {W_{f}.}}$

The C={tilde over (W)}₂ matrix consists of all the required linear combination coefficients (e.g., amplitude and phase or real or imaginary). Note that the coefficients matrix {tilde over (W)}₂ comprises 2LM coefficients. In the rest of the disclosure, several schemes are proposed for the uplink control information (UCI) carrying the CSI that is calculated using a PMI determined according to the above-identified framework (Eq. 5).

In one example, the PMI indicating the precoding matrix W^((R)) for R=v layers comprises a first PMI i1 and a second PMI i2. The first PMI corresponds to a wideband (WB) component of the PMI and the second PMI corresponds to a subband (SB) component of the PMI.

The first PMI i₁ comprises the following components:

-   -   orthogonal basis set for W₁ and W_(f) (which for example, can be         indicated using index i_(1,1) indicating the rotation factors         (q₁, q₂, q₃)), q_(i)ϵ{0, 1, . . . , O_(i)−1}; in one example,         O₃=1, hence q₃ can be fixed, for example, to q₃=0, and not         reported;     -   L beam selection for W₁ and M beam selection for W_(f) (which         for example, can be indicated using index i_(1,2));     -   strongest coefficient indicator (SCI) (which for example, can be         indicated using index i_(1,3)) indicating the strongest         coefficient out of 2LM coefficients comprising C={tilde over         (W)}₂; and indices of N_(0,l) non-zero (NZ) coefficients for         each layer l=1, . . . , v (which for example, can be indicated         using index i_(1,4)).

Here, i_(1,1), i_(1,2), i_(1,3), and i_(1,4) are components of the first PMI i₁. The indices of NZ coefficients are reported either explicitly using a bitmap B_(l) of length 2LM or a combinatorial index

$\left\lceil {\log_{2}\begin{pmatrix} {2LM} \\ N_{0,l} \end{pmatrix}} \right\rceil$

or is derived implicitly, for example, based on amplitude or power of beams comprising W₁ and/or W_(f). Bitmap B_(l) is assumed in the rest of the disclosure.

The second PMI i₂ comprises the following components:

-   -   phase ϕ_(l,i,m) of coefficients c_(l,i,m) (which for example,         can be indicated using index i_(2,1)); and     -   amplitude p_(l,i,m) of coefficients c_(l,i,m) (which for         example, can be indicated using index i_(2,2)).

Here, i_(2,1) and i_(2,2) are components of the second PMI i₂. In one example, amplitude p_(l,i,m)=p_(l,i,m) ⁽¹⁾p_(l,i,m) ⁽²⁾ where p_(l,i,m) ⁽¹⁾ and p_(l,i,m) ⁽²⁾ respectively are a first and a second amplitude component.

Let the total (sum) number of NZ coefficients across layers be N₀=Σ_(l=1) ^(v)N_(0,l). Let (i*, m*) be the index of the strongest coefficient c_(l,i*,m*) for layer l indicated by the SCI.

In embodiment A, the following quantization scheme is used to quantize/report amplitude of the N₀=K_(NZ) NZ coefficients. The UE reports the following for the quantization of the NZ coefficients in {tilde over (W)}₂

-   -   A ┌log₂ X┐-bit indicator for the strongest coefficient index         (i*,m*). In one example, X=K_(NZ).         -   Strongest coefficient c_(l,i*,m*)=1 (hence its             amplitude/phase are not reported)     -   Two antenna polarization-specific reference amplitudes:         -   For the polarization associated with the strongest             coefficient c_(l,i*,m*)=1, since the reference amplitude             p_(l,i,m) ⁽¹⁾=1, it is not reported)         -   For the other polarization, reference amplitude p_(l,i,m)             ⁽¹⁾ is quantized to A bits.             -   In one example, A=4, and the 4-bit amplitude alphabet is

$\begin{matrix} {\left\{ {1,\ \left( \frac{1}{2} \right)^{\frac{1}{4}},\ \left( \frac{1}{4} \right)^{\frac{1}{4}},\ \left( \frac{1}{8} \right)^{\frac{1}{4}},\ldots,\left( \frac{1}{2^{14}} \right)^{\frac{1}{4}},0} \right\}.} &  \end{matrix}$

-   -   For {c_(l,i,m), (i,m)≠(i*,m*)}:         -   For each polarization, differential amplitudes p_(l,i,m) ⁽²⁾             of the coefficients calculated relative to the associated             polarization-specific reference amplitude and quantized to B             bits.             -   In one example, B=3, and the 3-bit amplitude alphabet is

$\left\{ {1,\ \frac{1}{\sqrt{2}},\frac{1}{2},\frac{1}{2\sqrt{2}},\frac{1}{4},\frac{1}{4\sqrt{2}},\frac{1}{8},\frac{1}{8\sqrt{2}}} \right\}.$

-   -   -   -   Note: The final quantized amplitude p_(l,i,m) is given                 by p_(l,i,m) ⁽¹⁾×p_(l,i,m) ⁽²⁾ and the coefficient is                 given by

$\begin{matrix} {c_{l,i,m} = {{p_{ref}\left( \left\lfloor \frac{i}{L} \right\rfloor \right)} \times P_{l,i,m}^{(2)} \times {\varphi\left( {l,m} \right)}}} &  \end{matrix}$

Note that

$\begin{matrix} {p_{l,i,m}^{(1)} = {{p_{ref}\left( \left\lfloor \frac{i}{L} \right\rfloor \right)}.}} &  \end{matrix}$

In one alternative, “zero” in the 4-bit amplitude alphabet for the reference amplitude is removed and the associated code point is designated as “reserved” which implies that the associated code point is not used in reference amplitude reporting. For RIϵ{2,3,4}, different layers are independently quantized.

In one example, the components SCI, the indices of NZ coefficients, amplitude and phase are reported layer-specific, that is, they are reported independently for each layer. In this case, the indices i_(1,3), i_(1,4), i_(2,1) and i_(2,2) comprise v sub-indices. For example, when v=2, these indices are expressed further as

$i_{1,3} = \left\{ {\begin{matrix} {{\left\lbrack i_{1,3,1} \right\rbrack{RI}} = 1} \\ {{\left\lbrack {i_{1,3,1}i_{1,3,2}} \right\rbrack{RI}} = 2} \end{matrix},{i_{1,4} = \left\{ {\begin{matrix} {{\left\lbrack i_{1,4,1} \right\rbrack{RI}} = 1} \\ {{\left\lbrack {i_{1,4,1}i_{1,4,2}} \right\rbrack{RI}} = 2} \end{matrix},{i_{2,1} = \left\{ {{\begin{matrix} {{\left\lbrack i_{2,1,1} \right\rbrack{RI}} = 1} \\ {{\left\lbrack {i_{2,1,1}i_{2,1,2}} \right\rbrack{RI}} = 2} \end{matrix}{and} i_{2,2}} = \left\{ {\begin{matrix} {{\left\lbrack i_{2,2,1} \right\rbrack\ {RI}}\  = 1} \\ {{\left\lbrack {i_{2,2,1}\ i_{2,2,2}} \right\rbrack\ {RI}}\  = 2} \end{matrix}.} \right.} \right.}} \right.}} \right.$

Note that i_(1,3,2), i_(1,4,2), i_(2,1,2), and i_(2,1,2) are reported only when RI=2 is reported.

In one example, a single PMI i=[i₁, i₂, i₃, i₄, i₅, i₆] is used to report the first PMI indices i_(1,1), i_(1,2), i_(1,3), and i_(1,4), and the second PMI indices i_(2,1) and i_(2,2) by using the following mapping: i₁=i_(1,l), i₂=i_(1,2), i₃=i_(1,3), i₄=i_(1,4), i₅=i_(2,1), and i₆=i_(2,2).

FIG. 14 illustrates an example two-part UCI process 1400 according to embodiments of the present disclosure, as may be performed by a UE such as UE 116. The embodiment of the two-part UCI multiplexing process 1400 illustrated in FIG. 14 is for illustration only. FIG. 14 does not limit the scope of this disclosure to any particular implementation of the process 1400.

In embodiment 1, as shown in FIG. 14 , the two-part UCI multiplexing process 1400 is used to multiplex and report CSI according to the above-mentioned framework (Eq. 5), wherein:

-   -   CSI part 1 comprising CQI, RI, and (N_(0,1), . . . , N_(0,v))         are multiplexed and encoded together in UCI part 1, where         N_(0,l) indicates a number of non-zero (NZ) coefficients for         layer l; and     -   CSI part 2 comprising LI, the first PMI i₁ and the second PMI         (i₂) are multiplexed and encoded together in UCI part 2.

The CSI part 2 is segmented in two segments or three groups.

-   -   CSI part 2 wideband or group G0: comprising LI, and the first         PMI i1; and     -   CSI part 2 subband: comprising the second PMI i2, wherein the         components of the second PMI are grouped into two groups         -   G1: comprising a first group of second PMI components (for             example, amplitude and phase of a first group of NZ             coefficients)         -   G2: comprising a second group of second PMI components (for             example, amplitude and phase of a second group of NZ             coefficients).             Here, the bitmap B_(l) for all layers lϵ{1, . . . , v} is             included in the first PMI i₁.

In one example, the amplitude and phase indices associated with the strongest coefficient(s) are also included in G1 or/and G2. In another example, the amplitude and phase indices associated with the strongest coefficient(s) are excluded from (not included in) G1 and/or G2.

In a variation, LI is not included in UCI part 2 wideband or group G0. In another variation, LI is included in UCI part 1 (not in UCI part 2).

The part 1 UCI may also include CRI if the UE is configured with more than one CSI-RS resource. When cqi-FormatIndicator=widebandCQI, then CQI reported in part 1 UCI corresponds to WB CQI, and when cqi-FormatIndicator=subbandCQI, then CQI reported in part 1 UCI corresponds to WB CQI and SB differential CQI, where WB CQI is reported common for all SBs, and SB differential CQI is reported for each SB, and the number of SBs (or the set of SB indices) is configured to the UE.

In one example, the maximum value of RI is 4. In another example, the maximum value of RI can be more than 4. In this later example, the CQI in UCI part 1 corresponds to up to 4 layers mapped into a first codeword (CW1) or transport block (TB1), and if RI>4, then a second CQI is reported in UCI part 2, which corresponds to additional RI-4 layers mapped into a second codeword (CW2) or transport block (TB2).

In one example, the second CQI is included in CSI part 2 wideband. In another example, the second CQI is included in CSI part 2 subband. In one example, the second CQI is included in CSI part 2 wideband. In another example, when cqi-FormatIndicator=subbandCQI, then the second CQI comprises a WB second CQI included in CSI part 2 wideband and SB differential second CQI included in CSI part 2 subband.

Based on the value of the reported (N_(0,1), . . . , N_(0,v)) in part 1, the CSI reporting payload (bits) for part 2 is determined. In particular, the components of the second PMI i₂ are reported only for the coefficients that are non-zero.

FIG. 15 illustrates an example two-part UCI multiplexing process 1500 according to embodiments of the present disclosure, as may be performed by a UE such as UE 116. The embodiment of the two-part UCI multiplexing process 1500 illustrated in FIG. 15 is for illustration only. FIG. 15 does not limit the scope of this disclosure to any particular implementation of the process 1500.

In embodiment 1X, as shown in FIG. 15 , the CSI part 2 comprised in the two-part UCI multiplexing process 1500 is segmented in two segments or three groups:

-   -   CSI part 2 wideband or group G0: comprising LI, and SD rotation         factors indicating (q1, q2, q3), SD basis indicator indicating L         beam selection for W₁, and SCI(s) (indicated via the first PMI         i1); and     -   CSI part 2 subband: comprising the second PMI i2, wherein the         components of the second PMI are grouped into two groups         -   G1: comprising a first group of second PMI components (for             example, amplitude and phase of a first group of NZ             coefficients), and FD indicator indicating M beam selection             for W_(f) (indicated via the first PMI i1,2);         -   G2: comprising a second group of second PMI components (for             example, amplitude and phase of a second group of NZ             coefficients).

The rest of the details of embodiment 1 are also applicable in this embodiment.

In embodiment 1A, which is a variation of embodiment 1 or 1X, the two-part UCI multiplexing process is used to multiplex and report CSI according to the above-mentioned framework (Eq. 5), wherein

-   -   CSI part 1 comprising CQI, RI, and N₀=Σ_(l=1) ^(v) N_(0,l) are         multiplexed and encoded together in UCI part 1, where N₀         indicates the total number of NZ coefficients across v layers;         and     -   CSI part 2 comprising LI, the first PMI i1 and the second PMI         (i2) are multiplexed and encoded together in UCI part 2.

Note that number of NZ coefficients {N_(0,l)} for each layer is not reported in UCI part 1, their sum (N₀) is reported instead. The rest of the details of embodiment 1 1X (including the two segments) are also applicable in this embodiment.

In embodiment 1B, which is a variation of embodiment 1 or 1X, the two-part UCI multiplexing process is used to multiplex and report CSI as explained in embodiment 1 or 1X except that two groups G1 and G2 comprising the CSI part 2 subband are determined based on (N_(0,1), . . . , N_(0,v)) reported in UCI part 1. In particular:

-   -   G1: comprises amplitude and phase of a first half of NZ         coefficients c_(l,i,m) for all layer lϵ{1, . . . , v}; and     -   G2: comprises amplitude and phase of a second half of NZ         coefficients c_(l,i,m) for all layer lϵ{1, . . . ,v}.

FIG. 16 illustrates example two beam sorting (numbering) schemes 1600 according to embodiments of the present disclosure. The embodiment of the two beam sorting (numbering) schemes 1600 illustrated in FIG. 16 is for illustration only. FIG. 16 does not limit the scope of this disclosure to any particular implementation of the scheme 1600.

Let N_(0,l,1) and N_(0,l,2) respectively be the number of NZ coefficients in the first and second halves of NZ coefficients for layer l. Then, at least one of the following examples is used to determine the values N_(0,l,1) and N_(0,l,2).

In one example Ex 1B-0:

$N_{0,l,1} = {{\left\lceil \frac{N_{0,l}}{2} \right\rceil{and}N_{0,l,2}} = {{N_{0,l} - N_{0,l,1}} = \left\lfloor \frac{N_{0,l}}{2} \right\rfloor}}$

In one example Ex 1B-1:

$N_{0,l,1} = {{\left\lfloor \frac{N_{0,l}}{2} \right\rfloor{and}N_{0,l,2}} = {{N_{0,l} - N_{0,l,1}} = \left\lceil \frac{N_{0,l}}{2} \right\rceil}}$

In one example Ex 1B-2:

$N_{0,l,2} = {{\left\lceil \frac{N_{0,l}}{2} \right\rceil{and}N_{0,l,1}} = {{N_{0,l} - N_{0,l,2}} = \left\lfloor \frac{N_{0,l}}{2} \right\rfloor}}$

In one example Ex 1B-3:

$N_{0,l,2} = {{\left\lfloor \frac{N_{0,l}}{2} \right\rfloor{and}N_{0,l,1}} = {{N_{0,l} - N_{0,l,2}} = \left\lceil \frac{N_{0,l}}{2} \right\rceil}}$

For each layer l, the locations or indices of NZ coefficients are known via the respective bitmap reported in CSI part 1 wideband. To determine the two halves of the NZ coefficients, the N_(0,l) NZ coefficients are sorted or numbered according to at least one of the following schemes as illustrated in FIG. 16 :

-   -   Scheme 1B-0: the N_(0,l) NZ coefficients are sorted or numbered         sequentially 0 to N_(0,l)−1 first in the 1st dimension (or SD)         and then in the 2nd dimension (or FD). For a given NZ         coefficient with index (i^((k)),m^((k))), the sorted coefficient         index is then given by n^((k))=M_(l)i^((k))+m^((k)) where the         indices k=0, 1, . . . , N_(0,l)−1 are assigned such that n^((k))         increases as k increases;     -   Scheme 1B-1: the N_(0,l) NZ coefficients are sorted or numbered         sequentially 0 to N_(0,l)−1 first in the 2nd dimension (or FD)         and then in the 1st dimension (or SD). For a given NZ         coefficient with index (i^((k)),m^((k))), the sorted coefficient         index is then given by n^((k))=M_(l) ^((k))+m^((k)) where the         indices k=0, 1, . . . , N_(0,l)−1 are assigned such that n^((k))         increases as k increases.

2L_(l) and M_(l) respectively are the number of SD and FD basis vectors for layer l.

In embodiment 1C, which is a variation of embodiment 1A, the two-part UCI is used to multiplex and report CSI as explained in embodiment 1A except that two groups G1 and G2 comprising the CSI part 2 subband are determined based on the total (sum) number of NZ coefficients N₀=Σ_(l=1) ^(v)N_(0,l) reported in UCI part 1. In particular,

-   -   G1: includes amplitude and phase of a first half of the N₀ NZ         coefficients c_(l,i,m), and     -   G2: includes amplitude and phase of a second half of the N₀ NZ         coefficients c_(l,i,m).

Let N_(0,1) and N_(0,2) respectively be the number of NZ coefficients in the first and second halves of the N₀ NZ coefficients. Then, at least one of the following examples is used to determined the values N_(0,1) and N_(0,2).

-   -   In one example Ex 1C-0:

$N_{0,1} = {{\left\lceil \frac{N_{0}}{2} \right\rceil{and}N_{0,2}} = {{N_{0} - N_{0,1}} = \left\lfloor \frac{N_{0}}{2} \right\rfloor}}$

In one example Ex 1C-1:

$N_{0,1} = {{\left\lfloor \frac{N_{0}}{2} \right\rfloor{and}N_{0,2}} = {{N_{0} - N_{0,1}} = \left\lceil \frac{N_{0}}{2} \right\rceil}}$

-   -   In one example Ex 1C-2:

$N_{0,2} = {{\left\lceil \frac{N_{0}}{2} \right\rceil{and}N_{0,1}} = {{N_{0} - N_{0,2}} = \left\lfloor \frac{N_{0}}{2} \right\rfloor}}$

In one example Ex 1C-3:

$N_{0,2} = {{\left\lfloor \frac{N_{0}}{2} \right\rfloor{and}N_{0,1}} = {{N_{0} - N_{0,2}} = \left\lceil \frac{N_{0}}{2} \right\rceil}}$

For each layer l, the locations or indices of NZ coefficients are known via the respective bitmap reported in CSI part 1 wideband. To determine the two halves of the NZ coefficients, the total N₀ NZ coefficients are sorted or numbered according to at least one of the following schemes:

-   -   Scheme 1C-0: the N₀ NZ coefficients are sorted or numbered         sequentially 0 to N₀−1 in the following order, layer→SD→FD. That         is, numbering is first in the layer domain (across layers l=1 .         . . , v), then in the SD and then in the FD. For a given NZ         coefficient with index (l^((k)), i^((k)), m^((k))), the sorted         coefficient index is then given by         n^((k))=2L_(l)vm^((k))+vi^((k))+l^((k)) where the indices k=0,         1, . . . , N₀−1 are assigned such that n^((k)) increases as k         increases.     -   Scheme 1C-1: the N₀ NZ coefficients are sorted or numbered         sequentially 0 to N₀−1 in the following order, layer→FD→SD. That         is, numbering is first in the layer domain (across layers l=1 .         . . , v), then in the FD and then in the SD. For a given NZ         coefficient with index (l^((k)), i^((k)), m^((k))), the sorted         coefficient index is then given by         n^((k))=M_(l)i^((k))+vm^((k))+l^((k)) where the indices k=0, 1,         . . . , N₀−1 are assigned such that n^((k)) increases as k         increases.

Here 2L_(l) and M_(l) respectively are number of SD and FD basis vectors for layer l. The rest of the details of embodiment 1A or 1 or 1X (including the two segments) is also applicable here.

In embodiment 1D, when amplitudes of NZ coefficients are reported according to embodiment A, an A-bit reference amplitude p_(l,i,m) ⁽¹⁾ is reported for the other (weaker) antenna polarization. The reporting of this reference amplitude for the other (weaker) antenna polarization is according to at least one of the following alternatives.

In one alternative Alt 1D-0: the reference amplitude for the other antenna polarization is reported via UCI part 1. In one example, this reporting is separately as a separate UCI part 1 parameter (CSI part 1 parameter). In another example, this reporting is jointly with another UCI part 1 parameter (CSI part 1 parameter). For example, the reference amplitude can be reported jointly with the number of NZ coefficients reported in UCI part 1.

In one alternative Alt 1D-1: the reference amplitude for the other antenna polarization is reported via UCI part 2 wideband or group G0. In one example, this reporting is separately as a separate UCI part 2 wideband parameter (CSI part 2 wideband parameter). In another example, this reporting is jointly with another UCI part 2 wideband parameter (CSI part 2 wideband parameter). For example, the reference amplitude can be reported jointly with the SCI reported in UCI part 2 wideband.

In one alternative Alt 1D-2: the reference amplitude for the other antenna polarization is reported via UCI part 2 subband G1 or first segment or first group G1. In one example, this reporting is separately as a separate UCI part 2 subband parameter (CSI part 2 subband parameter). In another example, this reporting is jointly with another UCI part 2 subband parameter (CSI part 2 subband parameter). For example, the reference amplitude can be reported jointly with the differential amplitude reported in UCI part 2 subband.

In one alternative Alt 1D-3: the reference amplitude for the other antenna polarization is reported via UCI part 2 subband G2 or second segment or second group or G2. In one example, this reporting is separately as a separate UCI part 2 subband parameter (CSI part 2 subband parameter). In another example, this reporting is jointly with another UCI part 2 subband parameter (CSI part 2 subband parameter). For example, the reference amplitude can be reported jointly with the differential amplitude reported in UCI part 2 subband.

In embodiment 2, the UE is configured to a CSI report via two-part UCI according to a combination of embodiment 1X/1C and Alt 1D-2, wherein

-   -   Group G₀ includes at least SD rotation factors, SD basis         indicator, and SCI(s),     -   Group G₁ includes at least reference amplitude for weaker         polarization (cf. Alt 1D-2), amplitude and phase of NZ         coefficients in {c_(l,i,m):(l,i,m)ϵG₁}, and FD basis indicator,         and     -   Group G₂ includes at least amplitude and phase of NZ         coefficients in {c_(l,i,m):(l,i,m)ϵG₂}.

In one example, when N₃>19, M_(initial) indicator indicating the intermediate FD basis set InS comprising 2M FD basis vectors is included in G₁ together with the FD basis indicator for each layer.

In one example (Example E1), the amplitude and phase indices associated with the strongest coefficient(s) are also included in G1 or/and G2. In another example (Example E2), the amplitude and phase indices associated with the strongest coefficient(s) are excluded from (not included in) G1 or/and G2.

In a variation, LI is not included in group G0. In another variation, LI is included in UCI part 1 (not in G0).

The priority rule for determining G₁ and G₂ is according to at least one of the following alternatives.

In one alternative Alt 2-1-1, the NZ LC coefficients are prioritized from high to low priority according to (l, i, m) index triplet. The

N₀/2

highest priority coefficients belong to G1 and the

N₀/2

lowest priority coefficients belong to G2. The priority level is calculated as P(l, i, m)=2L·v·F₁(m)+v·F₂(i)+l, where F₁ and F₂ are fixed permutation functions for FD and SD indices. Note that F₁(m)=m if there is no permutation in FD. Likewise, F₂ (i)=i if there is no permutation in SD. If the amplitude and phase indices associated with the strongest coefficient(s) are according to Example E2, then at least of the following alternatives is used amplitude and phase reporting.

In one alternative Alt 2-1-1-1: If the strongest coefficient(s) belong(s) to G1, then

N₀/2

highest priority coefficients belong to G1, but the amplitude and phase indices of

N₀/2

−1 coefficients are included in G1, where −1 is due to the fact that the amplitude and phase of the strongest coefficient are not reported. For v=rank>1, the amplitude and phase indices of

N₀/2

−v coefficients are include in G1.

In one alternative Alt 2-1-1-2: If the strongest coefficient(s) belong(s) to G2, then the

N₀/2

lowest priority coefficients belong to G2, but the amplitude and phase indices of

N₀/2

−1 coefficients are include in G2, where −1 is due to the fact that the amplitude and phase of the strongest coefficient are not reported. For v=rank>1, the amplitude and phase indices of

N₀/2

−v coefficients are included in G2.

In one alternative Alt 2-1-2, the NZ coefficients c_(l,i,m) are sorted sequentially 0 to N₀−1 according to Scheme 1C-0 or 1C-1. The group G₁ comprises at least first

N₀/2

sorted coefficients, and group G₂ comprises the remaining second sorted coefficients.

In one alternative Alt 2-1-3, the LC coefficients are prioritized from high to low priority according to (l, i, m) index triplet. The

N₀/2

highest priority coefficients belong to G1 and the

N₀/4L

×2L lowest priority coefficients belong to G2. The priority level is calculated as P(l, i, m) defined in Alt 2-1-1.

The bitmap {b_(l,i,m)} is included in at least one of the three groups (G0, G1, and G2) according to at least one of the following alternatives (cf. embodiment 2).

In one alternative Alt 2-2-1, the first v·2LM−X bits according to P(l, i, m) value (i.e., high priority coefficients) belong in G₁, and the last X according to P(l, i, m) value (i.e., low priority coefficients) belong in G₂. In one example, this alternative is coupled with Alt 2-1-1. In one example,

${X = \frac{N_{0}}{2}}.$

In another example,

$X = {\left\lfloor \frac{N_{0}}{2} \right\rfloor.}$

In another example,

$X = {\left\lceil \frac{N_{0}}{2} \right\rceil.}$

In one alternative Alt 2-2-2, The bitmap and coefficients are segmented together into M segments (where M=number of FD basis indices). The group G₁ contains M₁ segments and the group G₂ contains M₂ segments, where M=M₁+M₂. In one example, each segment contains the bitmap (or a part of the bitmap) associated with all RI=v layers, all SD components and a single FD component (with index the same as the segment) and the corresponding amplitude/phase of coefficients. The payload size of G₁ is given by v·2LM+XT, where T=number of bits for amplitude and phase. The payload size of G₂ is X(a+b). In one example, this alternative is coupled with Alt 2-1-2. In one example,

$X = {\frac{N_{0}}{2}.}$

In another example, X=. In another example,

$X = {\left\lceil \frac{N_{0}}{2} \right\rceil.}$

In one alternative Alt 2-2-3, The first v·2LM−

N₀/4L

×2L bits according to P(l, i, m) value belong in G₁, and the last

N₀/4L

×2L according to P(l, i, m) value belong in G₂. In one example, this alternative is coupled with Alt 2-1-3.

In one alternative Alt 2-2-4, First v·LM bits according to P(l, i, m) value belong in G₁, and the last v·LM according to P(l, i, m) value belong in G₂. In one example, this alternative is coupled with Alt 2-1-1.

In one alternative Alt 2-2-5, the bitmap {b_(l,i,m)} is included in G₀.

In one alternative Alt 2-2-6, the bitmap {b_(l,i,m)} is included in G₁.

In one example, the priority level is defined as the following. If priority levels of two coefficients c_(l) ₂ _(,i) ₂ _(,m) ₂ and c_(l) ₂ _(,i) ₂ _(,m) ₂ are such that P(l₂, i₂, m₂)<P(l₁, i₁, m₁), then the coefficient c_(l) ₂ _(,i) ₂ _(,m) ₂ has a higher priority over c_(l) ₁ _(,i) ₁ _(,m) ₁ . In one example, if both NZ coefficients and bitmaps are partitioned into groups G₁ and G₂, then the priority ordering or function P(.) used to define the priority is the same for both NZ coefficients and bitmaps.

Let to m′=F₁(m) and i′=F₂ (i) respectively denote the FD and SD indices after the permutation.

In embodiment 2A, the permutation function F₁ in embodiment 2 is according to at least one of the following alternatives.

In one alternative Alt 2A-1: F₁(m)=m, i.e., there is no permutation in FD.

In one alternative Alt 2A-2: the permutation function F₁ is such that FD indices m=0, 1, . . . , M−1 are permuted to m′=0, M−1, 1, M−2, 2, M−3, . . . , which implies that FD basis indices in the middle or centre have lower priority, hence they will be dropped first.

In one alternative Alt 2A-3: the permutation function F₁ is given by

${{F_{1}(m)} = {{\left( {- 1} \right)^{m} \cdot m} + {\frac{1 - \left( {- 1} \right)^{m}}{2}M}}},$

which permutes (maps) FD indices m=0, 1, 2, . . . , M−1 to m′=0, M−1, 2, M−3, . . . .

In one alternative Alt 2A-3a: the permutation function F₁ is given by

${{F_{1}(m)} = {{\left( {- 1} \right)^{m} \cdot \left\lfloor \frac{m + 1}{2} \right\rfloor} + {\frac{1 - \left( {- 1} \right)^{m}}{2}M}}},$

which permutes (maps) FD indices m=0, 1, 2, . . . , M−1 to m′=0, M−1, 1, M−2, . . . .

In one alternative Alt 2A-3b: the permutation function F₁ is given by

${{F_{1}(m)} = {{\left( {- 1} \right)^{m} \cdot \left\lceil \frac{m}{2} \right\rceil}{mod}M}},$

which permutes (maps) FD indices m=0, 1, 2, . . . , M−1 to m′=0, M−1, 1, M−2, . . . .

In one alternative Alt 2A-3c: the permutation function F₁ is given by

${{F_{1}(m)} = {{\frac{1 + \left( {- 1} \right)^{m}}{2} \cdot \left( \frac{m}{2} \right)} + {\frac{1 - \left( {- 1} \right)^{m}}{2}\left( {M - \left( \frac{m + 1}{2} \right)} \right)}}},$

which permutes (maps) FD indices m=0, 1, 2, . . . , M−1 to m′=0, M−1, 1, M−2, . . . .

In one alternative Alt 2A-4: the permutation function F₁ is such that the FD index of the strongest coefficient (indicated via SCI) is permuted (mapped) to 0, the rest of the FD indices are indexed sequentially. At least one of the following examples is used.

-   -   In one example Ex 2A-4-1:         -   F_(i)(m*)=0         -   For m=0, 1, . . . m*−1, F₁(m)=m+1         -   For m=m*+1, . . . M−1, F₁(m)=m     -   In one example Ex 2A-4-2: m′=(m+1) mod (m*+1) for m=0, 1, . . .         m*, and m′=m otherwise. Note that this example is equivalent to         Ex 2A-4-1 (i.e., they result in the same permutation).

In one alternative Alt 2A-5: the permutation function F₁ first performs an index remapping or mapping (an example of which is explained below). Let {tilde over (m)}_(l) indicate the FD indices after the index remapping and mapping. The permutation function then permutes (rearranges) the remapped SD indices according to at least one of the following sub-alternatives.

In one alternative Alt 2A-5-1: the even-numbered FD indices precede (or are indexed or numbered before) odd-numbered FD indices, i.e., the remapped FD indices {tilde over (m)}_(l)=0, 1, . . . , M−1 are permuted to m′=0, x, 1, x+1, 2, x+2, . . . , where

$x = {\frac{M}{2}{or}\left\lfloor \frac{M}{2} \right\rfloor{or}{\left\lceil \frac{M}{2} \right\rceil.}}$

This is equivalent to the following examples.

-   -   In one example Ex 2A-5-1-1: for {tilde over (m)}_(l)=0, 2, . . .         , we have

${m^{\prime} = {{F_{1}\left( {\overset{\sim}{m}}_{l} \right)} = \frac{{\overset{\sim}{m}}_{l}}{2}}},$

-   -   and {tilde over (m)}_(l)=0, 1, . . . , we have

$m^{\prime} = {{F_{1}\left( {\overset{\sim}{m}}_{l} \right)} = {\left\lfloor \frac{{\overset{\sim}{m}}_{l}}{2} \right\rfloor{or}\frac{{\overset{\sim}{m}}_{l} - 1}{2}}}$

-   -   In one example Ex 2A-5-1-2:

$m^{\prime} = {{F_{1}\left( {\overset{\sim}{m}}_{l} \right)} = {{\left( \frac{1 + \left( {- 1} \right)^{{\overset{\sim}{m}}_{l}}}{2} \right) \cdot \frac{{\overset{\sim}{m}}_{l}}{2}} + {\left( \frac{1 - \left( {- 1} \right)^{{\overset{\sim}{m}}_{l}}}{2} \right)\left( \frac{{\overset{\sim}{m}}_{l} - 1}{2} \right)}}}$

-   -   In one example Ex 2A-5-1-3:

$m^{\prime} = {{F_{1}\left( {\overset{\sim}{m}}_{l} \right)} = {{\left( \frac{1 + \left( {- 1} \right)^{{\overset{\sim}{m}}_{l}}}{2} \right) \cdot \frac{{\overset{\sim}{m}}_{l}}{2}} + {\left( \frac{1 - \left( {- 1} \right)^{{\overset{\sim}{m}}_{l}}}{2} \right)\left\lfloor \frac{{\overset{\sim}{m}}_{l}}{2} \right\rfloor}}}$

In one alternative Alt 2A-5-2: the odd-numbered FD indices precede (or are indexed or numbered before) even-numbered FD indices, i.e., the remapped FD indices {tilde over (m)}_(l)=0, 1, . . . , M−1 are permuted to m′=0, 1, . . . , M−1 are permuted to m′=x, 0, x+1, 1, x+2, 2, . . . , where

$x = {\frac{M}{2}{or}\left\lfloor \frac{M}{2} \right\rfloor{or}{\left\lceil \frac{M}{2} \right\rceil.}}$

In one alternative Alt 2A-6: the same as Alt 2A-5 expect that the first step (index remapping) is not performed.

In one example, the index remapping or mapping in Alt 2A-5 is performed as follows.

Let the location or index of the strongest coefficient for layer l before index remapping or mapping is (i_(l), m_(l)*). For layer l, the index (i_(l), m_(l)) of all non-zero (NZ) coefficients c_(l,i) _(l) _(,m) _(l) is remapped or mapped with respect to m_(l)* to m_(l) such that the strongest coefficient index (SCI) is remapped or mapped as (i*_(l),{tilde over (m)}*_(l))=)i*_(l),0). The FD basis indices {k_(m) _(l) } associated with all NZ coefficients c_(l,i) _(l) _(,m) _(l) are remapped or mapped with respect to k_(m*) _(l) to {tilde over (k)}_(m) _(l) such that the FD basis index of the strongest coefficient is remapped or mapped as {acute over (k)}_(m*) _(l) =0.

Since remapping or mapping is performed only in FD (i.e., no remapping or mapping of SD index i_(l)), the following is an equivalent remapping/mapping. For layer l, the index m_(l) of each non-zero (NZ) coefficient c_(l,i) _(l) _(,m) _(l) is remapped or mapped with respect to m*_(l) to {tilde over (m)}_(l) such that the strongest coefficient index (SCI) is remapped or mapped as {tilde over (m)}*_(l)=0. The FD basis indices {k_(m) _(l) } associated with each NZ coefficient c_(l,i) _(l) _(,m) _(l) is remapped or mapped with respect to k_(m*) _(l) , to {tilde over (k)}_(m) _(l) such that the FD basis index of the strongest coefficient is remapped or mapped as {tilde over (k)}_(m*) _(l) =0.

In one example, the remapping or mapping is performed as follows. The index (i_(l), m_(l)) of each non-zero (NZ) coefficient c_(l,i) _(l) _(,m) _(l) is remapped or mapped as (i_(l), m_(l))→(i_(l), {tilde over (m)}_(i)=(m_(l)−m*_(l)) mod M_(l)). Alternatively, the index m_(l) of each non-zero (NZ) coefficient c_(l,i,m) is remapped or mapped as m_(l)→{tilde over (m)}_(l)=(m_(l)−m*_(l)) mod M_(l). The FD basis index k_(m) _(l) associated with each NZ coefficient c_(l,i) _(l) _(,m) _(l) is remapped or mapped as k_(m) _(l) →k_(m) _(l) =(k_(m) _(l) −k_(m*) _(l) ) mod N₃.

In embodiment 2B, the permutation function F₂ in embodiment 2 is according to at least one of the following alternatives.

In one alternative Alt 2B-1: F₂(i)=i, i.e., there is no permutation in SD.

In one alternative Alt 2B-2: the permutation function F₂ is such that SD indices i=0, 1, . . . , 2L−1 are permuted to i′=i*, i*+L, i*+1, i*+L+1, . . . , where i* is the SD index of the strongest coefficient (indicated via SCI).

In one alternative Alt 2B-3: the permutation function F₂ is such that the SD index of the strongest coefficient (indicated via SCI) is permuted (mapped) to 0, the rest of the SD indices are indexed sequentially. At least one of the following examples is used.

In one example Ex 2B-3-1:

-   -   F₂(i*)=0     -   For i=0, 1, . . . i*−1, F₂(i)=i+1     -   For i=i*+1, 2L−1, F₂(i)=i

In one example Ex 2B-3-2: =(i+1) mod (i*+1) for i=0, 1, i*, and i′=i otherwise. Note that this example is equivalent to Ex 2B-3-1 (i.e., they result in the same permutation).

In one example Ex 2B-3-3:

-   -   F₂(i*)=0     -   F₂(i*+L)=1 or F₂ ((i*+L) mod 2L)=1     -   Let m₁=min(i*, (i*+L) mod 2L) and m₂=max(i*, (i*+L) mod 2L)     -   For i=0, 1, . . . m₁−1, F₂ (i)=i+2     -   For i=m₁+1, m₁+2, . . . , m₂−1, F₂(i)=i+1     -   For i=m₂+1, . . . 2L−1, F₂(i)=i

In one alternative Alt 2B-4: the permutation function F₂ first performs an index remapping or mapping (an example of which is explained below). Let ĩ_(l) indicate the SD indices after the index remapping and mapping. The permutation function then permutes (rearranges) the remapped SD indices according to at least one of the following sub-alternatives.

In one alternative Alt 2B-4-1: the even-numbered SD indices precede (or are indexed or numbered before) odd-numbered SD indices, i.e., the remapped SD indices i=0, 1, . . . , 2L−1 are permuted to l′=0, L, 1, L+1, 2, L+2, . . . , . This is equivalent to the following examples.

In one example Ex 2B-4-1-1: for ĩ_(l)=0, 2, . . . , we have

${i^{\prime} = {{F_{2}\left( {\overset{\sim}{i}}_{l} \right)} = \frac{{\overset{\sim}{i}}_{l}}{2}}},$

and ĩ_(l)=0, 1, . . . , we have

$i^{\prime} = {{F_{2}\left( {\overset{\sim}{i}}_{l} \right)} = {\left\lfloor \frac{{\overset{\sim}{i}}_{l}}{2} \right\rfloor{or}\frac{{\overset{\sim}{i}}_{l} - 1}{2}}}$

In one example Ex 2B-4-1-2:

$i^{\prime} = {{F_{2}\left( {\overset{\sim}{i}}_{l} \right)} = {{\left( \frac{1 + \left( {- 1} \right)^{{\overset{\sim}{i}}_{l}}}{2} \right) \cdot \frac{{\overset{\sim}{i}}_{l}}{2}} + {\left( \frac{1 - \left( {- 1} \right)^{{\overset{\sim}{i}}_{l}}}{2} \right)\left( \frac{{\overset{\sim}{i}}_{l} - 1}{2} \right)}}}$

In one example Ex 2B-4-1-3:

$i^{\prime} = {{F_{2}\left( {\overset{\sim}{l}}_{l} \right)} = {{\left( \frac{1 + \left( {- 1} \right)^{i_{l}}}{2} \right) \cdot \frac{{\overset{\sim}{l}}_{l}}{2}} + {\left( \frac{1 - \left( {- 1} \right)^{{\overset{\sim}{l}}_{l}}}{2} \right)\left\lfloor \frac{{\overset{\sim}{l}}_{l}}{2} \right\rfloor}}}$

In one alternative Alt 2B-4-2: the odd-numbered SD indices precede (or are indexed or numbered before) even-numbered SD indices, i.e., the remapped SD indices ĩ_(l)=0, 1, . . . , 2L−1 are permuted to i′=0, 1, . . . , 2L−1 are permuted to i′=L, 0, L+1, 1, L+2, 2, . . . .

In one alternative Alt 2B-5: the same as Alt 2B-4 expect that the first step (index remapping) is not performed.

In one alternative Alt 2B-6: the permutation function F₂ is such that the SD indices of the stronger antenna polarization precede (or are indexed or numbered before) the SD indices of the weaker antenna polarization. Let rϵ{0,1} indicate an antenna polarization. Note that SD indices i=0, 1 . . . , L−1 are associated with (or correspond to or comprise) one antenna polarization (r=0) and SD indices i=L, L+1, . . . , 2L−1 are associated with (or correspond to or comprise) the other antenna polarization (r=1). In one example, the stronger antenna polarization corresponds to the antenna polarization of the strongest coefficient (indicated via SCI). In particular,

$r^{*} = \left\lfloor \frac{i^{*}}{L} \right\rfloor$

is the antenna polarization of the strongest coefficient. Then, the SD indices {r*L+x: x=0, 1, 2, . . . , L−1} belong to the stronger polarization, hence precede the rest of the coefficients (in weaker polarization). Let S₁={r*L+x:x=0, 1, 2, . . . , L−1} and S₂={(1−r*)L+x: x=0, 1, 2, . . . , L−1}, then the permutation function F₂ is such that SD indices i=S={0, 1, . . . , 2L−1} are permuted to i′=[S₁,S₂].

In one example, the index remapping or mapping in Alt 2B-4 is performed as follows.

Let the location or index of the strongest coefficient for layer l before index remapping or mapping is (i*_(l),m*_(l)). For layer l, the index (i_(l), m_(l)) of all non-zero (NZ) coefficients c_(l,i) _(l) _(,m) _(l) is remapped or mapped with respect to k_(i*) _(l) to {tilde over (k)}_(i) l such that the strongest coefficient index (SCI) is remapped or mapped as (ĩ*_(l), m*_(l))=(0, m*_(l)). The SD basis indices {k_(i) _(l) } associated with all NZ coefficients c_(l,i) _(l) _(,m) _(l) are remapped or mapped with respect to k_(i*) _(l) to {tilde over (k)}_(i) _(l) such that the SD basis index of the strongest coefficient is remapped or mapped as {tilde over (k)}_(i*) _(l) =0.

Since remapping or mapping is performed only in SD (i.e., no remapping or mapping of FD index m_(l)), the following is an equivalent remapping/mapping. For layer l, the index i_(l) of each non-zero (NZ) coefficient c_(l,i) _(l) _(,m) _(l) is remapped or mapped with respect to i*_(l) to ĩ_(l) such that the strongest coefficient index (SCI) is remapped or mapped as ĩ*_(l)=0. The SD basis indices {k_(i) _(l) } associated with each NZ coefficient C_(l,i) _(l) _(,m) _(l) is remapped or mapped with respect to k_(i*) _(l) to {tilde over (k)}_(i) _(l) such that the SD basis index of the strongest coefficient is remapped or mapped as {tilde over (k)}_(i*) _(l) =0.

In one example, the remapping or mapping is performed as follows. The index (i_(l), m_(l)) of each non-zero (NZ) coefficient c_(l,i) _(l) _(,m) _(l) is remapped or mapped as (i_(l), m_(l))→(ĩ_(l)=(i_(l)−i*_(l)) mod 2L, m_(l),). Alternatively, the index i_(l) of each non-zero (NZ) coefficient c_(l,i,m) is remapped or mapped as i_(l)−ĩ_(l)=(i_(l)−i*_(l)) mod 2L. The SD basis index k_(i) _(l) associated with each NZ coefficient C_(l,i) _(l) _(,m) _(l) is remapped or mapped as k_(i) _(l) →{tilde over (k)}_(i)=(k_(i) _(l) −k_(i*) _(l) ) mod N₁N₂.

In embodiment 2C, the NZ coefficients {c_(l,i,m)} and bitmap {b_(l,i,m)} are partitioned into groups G₁ and G₂ according to Alt 2-1-1 and Alt 2-2-1, respectively, where one of sub-alternatives Alt 2-1-1-1 and Alt 2-1-1-2 of Alt 2-1-1 is used. For instance,

-   -   G₁ comprises the         N₀/2         highest priority NZ coefficients {c_(l,i,m)} and the v·2LM−         N₀/2         highest priority bits of bitmap {b_(l,i,m)}     -   G₂ comprises the         N₀/2         lowest priority NZ coefficients {c_(l,i,m)} and the └N₀/2┘         lowest priority bits of bitmap {b_(l,i,m)}

The priority level is defined as the following. If priority levels of two coefficients c_(l) ₁ _(,i) ₁ _(,m) ₁ and c_(l) ₂ _(,i) ₂ _(,m) ₂ are such that P(l₂, i₂, m₂)<P(l₁,i₁,m_(i)), then the coefficient c_(l) ₂ _(,i) ₂ _(,m) ₂ has a higher priority over c_(l) ₁ _(,i) ₁ _(,m) ₁ . The NZ coefficients {c_(l,i,m)} and bitmap {b_(l,i,m)} are prioritized/ordered from high to low priority according to (l, i, m) with the same priority function P(l, i, m)=2L·v·F₁(m)+v·F₂(i)+, where the priority function F₁(m) is according to at least one of Alt 2A-1 through Alt 2A-6, and the priority function F₂ (i) is according to at least one of Alt 2B-1 through Alt 2B-6.

In one example, the permutation function F₂ is according to Alt 2B-1, i.e., F₂(i)=i, i.e., there is no permutation in SD. The priority function P(l, i, m)=2L·v·F₁(m)+v·i+l. The priority function F₁(m) is according to at least one of Alt 2A-1 through Alt 2A-6.

In another example, the priority level is calculated as P(l, i, m)=2L·v·F₁(m)+v·i+l where F₁(m) maps/permutes the index m according to the following priority/permutation order of the corresponding FD basis components/indices k_(m) (if FD basis index k_(m) is selected/reported by the UE). Note that there is one-to-one correspondence between FD indices m=0, 1, . . . , M−1 and FD basis indices k₀, k₁, . . . k_(M-1) which is reported by the UE. The FD basis components k_(m)=0, 1, 2, . . . , N₃−1 are permuted (mapped) to G (k_(m))=0, N₃−1,1, N₃−2, 2, . . . using a permutation function G(.). The function G(.) is according to at least one of the following alternatives.

In one alternative Alt 2C-1: the permutation function G is given by

${{G(k)} = {{\left( {- 1} \right)^{k} \cdot \left\lfloor \frac{k + 1}{2} \right\rfloor} + {\frac{1 - \left( {- 1} \right)^{k}}{2}N_{3}}}},$

which permutes (maps) FD basis components k=0, 1, 2, . . . , N₃−1 to G(k)=0, N₃−1,1, N₃−2, 2, . . . .

In one alternative Alt 2C-2: the permutation function G is given by

${{G(k)} = {{\left( {- 1} \right)^{k} \cdot \left\lceil \frac{k}{2} \right\rceil}{mod}N_{3}}},$

which permutes (maps) FD indices k=0, 1, 2, . . . , N₃−1 to G(k)=0, N₃−1,1, N₃−2, 2, . . . .

In one alternative Alt 2C-3: the permutation function G is given by

${{G(k)} = {{\frac{1 + \left( {- 1} \right)^{k}}{2} \cdot \left( \frac{k}{2} \right)} + {\frac{1 - \left( {- 1} \right)^{k}}{2}\left( {N_{3} - \left( \frac{k + 1}{2} \right)} \right)}}},$

which permutes (maps) FD indices k=0, 1, 2, . . . , N₃−1 to G(k)=0, N₃−1,1, N₃−2,2, . . . .

In one alternative Alt 2C-4: the permutation function G is given by G(k)=min (2k, 2(N₃−k)−1) which assigns priorities 0, 1, 2, . . . , N₃−1 to FD basis components k=0, N₃−1,1, N₃−2, 2, . . . , respectively.

In one example, the index remapping or mapping (cf. embodiment 2A) is performed before applying the permutation function F₁(m). The details of the index remapping or mapping as explained in embodiment 2A. Note that the M FD basis indices {k_(m): m=0, 1, . . . M−1} are reported by the UE from the set of {0, 1, . . . , N₃−1} FD indices.

In another example, the permutation function F₂ is according to Alt 2B-1, i.e., F₂ (0=i, i.e., there is no permutation in SD. The priority function P (l, i, m)=2L·v·F₁(m)+v·i+l. The priority function F₁(m) is higher layer (e.g. RRC) configured from Alt 2A-1 and Alt X, where X is at least one of {Alt 2A-2 through Alt 2A-6, and Alt 2C-1 through Alt 2C-3}.

In embodiment 3, the NZ coefficients are grouped based on both the SCI index (i*, m*) and the ordering of the NZ coefficients (cf. embodiment 2). At least one of the following alternative can be used.

In one alternative Alt 3-1, for a given layer l, the set of coefficients S₁ with indices (i, m) such that i=i* or m=m* have higher priority than the other set of coefficients S₂ with indices (i, m) such that i≠i* and m≠m*.

In one example, for coefficients in S₁, the priority is determined as follows.

-   -   Step 1: coefficients in S₁ with FD index m=m* are prioritized         first according to P(l, i, m*)=v·F₂ (i)+l.     -   Step 2: coefficients in S₁ with SD index i=i* are prioritized         second according to P(l, i*, m)=X+vF₁(m)+l, where X=2vL is the         number of coefficients from Step 1.

For coefficients in S₂, the priority is determined as P(l, i, m)=Y+(2L−1)·v·F₁(m)+v·F₂(i)+1, where Y=v(2L+M−1) is the number of coefficients from Step 1 and Step 2.

In one alternative Alt 3-2, for a given layer l, the set of coefficients S₁ with indices (i, m) such that i=i* or i=i*+L or m=m* have higher priority than the other set of coefficients S₂ with indices (i, m) such that i≠i*, i≠i*+L and m≠m*.

In one example, for coefficients in S₁, the priority is determined as follows.

-   -   Step 1: coefficients in S₁ with FD index m=m* are prioritized         first according to P(l, i, m*)=v·F₂ (i)+l.

Step 2: coefficients in S₁ with SD index i=i* are prioritized second according to P(l, i*, m)=X+(M−1)vF₂(i)+vF₁(m)+1, where X=2vL is the number of coefficients from Step 1.

For coefficients in S₂, the priority is determined as P(l, i, m)=Y+(2L−2)·v·F₁(m)+v·F₂ (i)+l, where Y=v(2L+2(M−1)) is the number of coefficients from Step 1 and Step 2.

The permutation function F₁ and F₂ are according to at least one alternatives in this disclosure (embodiment 2/2A/2B).

Here the notation └x┘ indicates a floor function which maps x to a smaller integer number a such that a is the largest integer such that a<x. Likewise, the notation ┌x┐ a ceiling function which maps x to a larger integer number a such that a is the smallest integer such that x<a. Also, the notation |x| indicates the absolute value of x.

In an embodiment (e.g., embodiment X), each PMI value, indicating the precoder or precoding matrix according the framework (5), corresponds to the codebook indices i₁ and i₂ where:

$i_{1} = \left\{ \begin{matrix} {\left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}} \right\rbrack} & {v = 1} \\ {\left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}i_{1,6,2}i_{1,7,2}i_{1,8,2}} \right\rbrack} & {v = 2} \\ {\left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}i_{1,6,2}i_{1,7,2}i_{1,8,2}i_{1,6,3}i_{1,7,3}i_{1,8,3}} \right\rbrack} & {v = 3} \\ \left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}i_{1,6,2}i_{1,7,2}i_{1,8,2}i_{1,6,3}i_{1,7,3}i_{1,8,3}i_{1,6,4}i_{1,7,4}i_{1,8,4}} \right\rbrack & {v = 4} \end{matrix} \right.$ $i_{2} = \left\{ {\begin{matrix} {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}} \right\rbrack} \\ {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}i_{2,3,2}i_{2,4,2}i_{2,5,2}} \right\rbrack} \\ {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}i_{2,3,2}i_{2,4,2}i_{2,5,2}i_{2,3,3}i_{2,4,3}i_{2,5,3}} \right\rbrack} \\ {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}i_{2,3,2}i_{2,4,2}i_{2,5,2}i_{2,3,3}i_{2,4,3}i_{2,5,3}i_{2,3,4}i_{2,4,4}i_{2,5,4}} \right\rbrack} \end{matrix}\begin{matrix} {v = 1} \\ {v = 2} \\ {v = 3} \\ {v = 4} \end{matrix}} \right.$

where:

i_(1,1) are the rotation factors for the SD basis (same as in Type II CSI codebook);

i_(1,2) is the SD basis indicator (same as in Type II CSI codebook);

i_(1,5) is the M_(initial) indicator when N₃>19, indicating the intermediate FD basis set InS comprising 2M FD basis vectors;

i_(1,6,l) is the FD basis indicator for layer l, indicating M FD basis vectors;

i_(1,7,l) is the bitmap for layer l, indicating the location of non-zero (NZ) coefficients;

i_(1,8,l) is the strongest coefficient indicator (SCI) for layer l, indicating location of the strongest coefficient=1;

i_(2,3,l) are the reference amplitudes)) for layer l, indicating the reference amplitude coefficient for the weaker polarization;

i_(2,4,l) is the matrix of the differential amplitude values (p_(l,i,m) ⁽²⁾) for layer l;

i_(2,5,l) is the matrix of the phase values (φ_(l,i,m)) for layer l.

In embodiment Y, the embodiment 2C is used for UCI omission procedure. The UCI the bitwidth for PMI of codebookType=typeII-r16 is provided in Table 1, where the values of (N₁, N₂), (O₁, O₂), L, K_(NZ,TOT), N₃, R, β, y₀ and v₀ are given by Subclause 5.2.2.2.5 in [REF8].

TABLE 1 PMI of codebookType = typeIIr16 Information fields x₁ for PMI (for group G0) i_(1,1) i_(1,2) i_(1,8,1) i_(1,8,2) i_(1,8,3) i_(1,8,4) Rank = 1 ┌log₂(O₁O₂)┐ $\left\lceil {\log_{2}\begin{pmatrix} {N_{1}N_{2}} \\ L \end{pmatrix}} \right\rceil$ ┌log₂ K_(NZ,TOT)┐ N/A N/A N/A Rank = 2 ┌log₂(O₁O₂)┐ $\left\lceil {\log_{2}\begin{pmatrix} {N_{1}N_{2}} \\ L \end{pmatrix}} \right\rceil$ ┌log₂ (2L)┐ ┌log₂ (2L)┐ N/A N/A Rank = 3 ┌log₂(O₁O₂)┐ $\left\lceil {\log_{2}\begin{pmatrix} {N_{1}N_{2}} \\ L \end{pmatrix}} \right\rceil$ ┌log₂ (2L)┐ ┌log₂ (2L)┐ ┌log₂ (2L)┐ N/A Rank = 4 ┌log₂(O₁O₂)┐ $\left\lceil {\log_{2}\begin{pmatrix} {N_{1}N_{2}} \\ L \end{pmatrix}} \right\rceil$ ┌log₂ (2L)┐ ┌log₂ (2L)┐ ┌log₂ (2L)┐ ┌log₂ (2L)┐ Information fields X₂ for PMI (for group G1) i_(1,5) i_(1,6,) i_(1,6,2) i_(1,6,3) i_(1,6,4) i_(1,7,1) Rank = 1 0 if N₃ ≤ 19; ┌log₂ 2M_(v)┐ if N₃ > 19 $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; N/A N/A N/A 2LM_(v) $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 Rank = 2 0 if N₃ ≤ 19; ┌log₂ 2M_(v)┐ if N₃ > 19 $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; N/A N/A 2LM_(v) $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 Rank = 3 0 if N₃ ≤ 19; ┌log₂ 2M_(v)┐ if N₃ > 19 $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19 $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; N/A 2LM_(v) $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19; Rank = 4 0 if N₃ ≤ 19; ┌log₂ 2M_(v)┐ if N₃ > 19 $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; 2LM_(v) $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19; Information fields X₂ for PMI (for group G1) i_(1,7,2) i_(1,7,3) i_(1,7,4) i_(2,3,1) i_(2,3,2) i_(2,3,3) i_(2,3,4) Rank = 1 N/A N/A N/A 4 N/A N/A N/A Rank = 2 2LM_(v) N/A N/A 4 4 N/A N/A Rank = 3 2LM_(v) 2LM_(v) N/A 4 4 4 N/A Rank = 4 2LM_(v) 2LM_(v) 2LM_(v) 4 4 4 4 Information fields X₂ for PMI (for group G2) i_(2,4,1) i_(2,4,2) i_(2,4,3) i_(2,4,4) i_(2,5,1) i_(2,5,2) i_(2,5,3) i_(2,5,4) Rank = 1 3(K_(NZ,1) − 1) N/A N/A N/A 4(K_(NZ,1) − 1) N/A N/A N/A Rank = 2 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) N/A N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 1) N/A N/A Rank = 3 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 1) 4(K_(NZ,3) − 1) N/A Rank = 4 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) 3(K_(NZ,4) − 1) 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 1) 4(K_(NZ,3) − 1) 4(K_(NZ,4) − 1)

Where, K_(NZ,l) is the number of nonzero coefficients for layer l and K_(NZ,TOT)=Σ_(l=1) ^(v)K_(NZ,1)≤2K₀ is the total number of nonzero coefficients, and v is a rank indicator value indicated via the rank indicator value.

The bitwidth for PMI of codebookType=typeIIr16PortSelection is provided in Table 2, where the values of P_(CSI-RS), d, L, K_(NZ,TOT), N₃, R, β, y₀ and v₀ are given by Subclause 5.2.2.2.6 in [REFS].

TABLE 2 PMI of codebookType = typeIIr16PortSelection Information fields x₁ for PMI (for group G0) i_(1,1) i_(1,8,1) i_(1,8,2) i_(1,8,3) i_(1,8,4) Rank = 1 $\left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil$ ┌log₂ K_(NZ,TOT)┐ N/A N/A N/A Rank = 2 $\left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil$ ┌log₂ (2L)┐ ┌log₂ (2L)┐ N/A N/A Rank = 3 $\left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil$ ┌log₂ (2L)┐ ┌log₂ (2L)┐ ┌log₂ (2L)┐ N/A Rank = 4 $\left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil$ ┌log₂ (2L)┐ ┌log₂ (2L)┐ ┌log₂ (2L)┐ ┌log₂ (2L)┐ Information fields X₂ for PMI (for group G1) i_(1,5) i_(1,6,) i_(1,6,2) i_(1,6,3) i_(1,6,4) i_(1,7,1) Rank = 1 0 if N₃ ≤ 19; ┌log₂ 2M_(v)┐ if N₃ > 19 $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; N/A N/A N/A 2LM_(v) $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 Rank = 2 0 if N₃ ≤ 19; ┌log₂ 2M_(v)┐ if N₃ > 19 $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; N/A N/A 2LM_(v) $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 Rank = 3 0 if N₃ ≤ 19; ┌log₂ 2M_(v)┐ if N₃ > 19 $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19 $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; N/A 2LM_(v) $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19; Rank = 4 0 if N₃ ≤ 19; ┌log₂ 2M_(v)┐ if N₃ > 19 $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ ≤ 19; 2LM_(v) $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19; Information fields X₂ for PMI (for group G1) i_(1,7,2) i_(1,7,3) i_(1,7,4) i_(2,3,1) i_(2,3,2) i_(2,3,3) i_(2,3,4) Rank = 1 N/A N/A N/A 4 N/A N/A N/A Rank = 2 2LM_(v) N/A N/A 4 4 N/A N/A Rank = 3 2LM_(v) 2LM_(v) N/A 4 4 4 N/A Rank = 4 2LM_(v) 2LM_(v) 2LM_(v) 4 4 4 4 Information fields X₂ for PMI (for group G2) i_(2,4,1) i_(2,4,2) i_(2,4,3) i_(2,4,4) i_(2,5,1) i_(2,5,2) i_(2,5,3) i_(2,5,4) Rank = 1 3(K_(NZ,1) − 1) N/A N/A N/A 4(K_(NZ,1) − 1) N/A N/A N/A Rank = 2 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) N/A N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 1) N/A N/A Rank = 3 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 1) 4(K_(NZ,3) − 1) N/A Rank = 4 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) 3(K_(NZ,4) − 1) 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 1) 4(K_(NZ,3) − 1) 4(K_(NZ,4) − 1)

Where, K_(NZ,l) is the number of nonzero coefficients for layer l and K_(NZ,TOT)=Σ_(l=1) ^(v)K_(NZ,l)≤2K₀ is the total number of nonzero coefficients, and v is a rank indicator value indicated via the rank indicator value.

For CSI on PUSCH, two UCI bit sequences are generated, a₀ ⁽¹⁾,a₁ ⁽¹⁾,a₂ ⁽¹⁾,a₃ ⁽¹⁾, . . . , a_(A) ₍₂₎ ⁻¹ ⁽¹⁾ and a₀ ⁽²⁾, a₁ ⁽²⁾, a₂ ⁽²⁾, a₃ ⁽²⁾, . . . , a_(A) ₍₂₎ ⁻¹ ⁽²⁾. The CSI fields of all CSI reports, in the order from upper part to lower part in Table 6.3.2.1.2-6 [REF7], are mapped to the UCI bit sequence a₀ ⁽¹⁾,a₁ ⁽¹⁾, a₂ ⁽¹⁾, a₃ ⁽¹⁾, . . . , a_(A) ₍₂₎ ⁻¹ ⁽¹⁾ starting with a₀ ⁽¹⁾. The CSI fields of all CSI reports, in the order from upper part to lower part in Table 3, are mapped to the UCI bit sequence a₀ ⁽²⁾, a₁ ⁽²⁾, a₂ ⁽²⁾, a₃ ⁽²⁾, . . . , a_(A) ₍₂₎ ⁻¹ ⁽²⁾ starting with a₀ ⁽²⁾.

TABLE 3 Mapping order of CSI reports to UCI bit sequence a₀ ⁽²⁾, a₁ ⁽²⁾, a₂ ⁽²⁾, a₃ ⁽²⁾, . . . , a_(A) ₍₂₎ ⁻¹ ⁽²⁾, with two-part CSI report(s) UCI bit sequence CSI report number $\begin{matrix} a_{0}^{(2)} \\ a_{1}^{(2)} \\ a_{2}^{(2)} \\ a_{3}^{(2)} \\  \vdots \\ a_{A^{(2)} - 1}^{(2)} \end{matrix}$ CSI report #1, Group 0 CSI as in Table4/Table 5 if CSI report #1 is configured as ‘typeIIr16’ or ‘typeIIr16-PortSelection’; CSI part 2 wideband, as in Table 6.3.2.1.2-4 [REF7] otherwise, if CSI part 2 exists for CSI report #1 CSI report #2, Group 0 CSI as in Table 4/Table 5 if CSI report #2 is configured as ‘typeIIr16’ or ‘typeIIr16-PortSelection’; CSI part 2 wideband, as in Table 6.3.2.1.2-4 [REF7] otherwise, if CSI part 2 exists for CSI report #2 · · · CSI report #n, Group 0 CSI as in Table 4/Table 5 if CSI report #n is configured as ‘typeIIr16’ or ‘typeIIr16-PortSelection’; CSI part 2 wideband, as in Table 6.3.2.1.2-4 [REF7] otherwise, if CSI part 2 exists for CSI report #n CSI report #1, Group 1 and Group 2 CSI as in Table 4/Table 5 if CSI report #1 is configured as ‘typeIIr16’ or ‘typeIIr16- PortSelection’; CSI part 2 subband, as in Table 6.3.2.1.2-5 [REF7] otherwise, if CSI part 2 exists for CSI report #1 CSI report #2, Group 1 and Group 2 CSI as in Table 4/Table 5 if CSI report #2 is configured as ‘typeIIr16’ or ‘typeIIr16- PortSelection’;CSI part 2 subband, as in Table 6.3.2.1.2-5 [REF7] otherwise, if CSI part 2 exists for CSI report #2 · · · CSI report #n, Group 1 and Group 2 CSI as in Table 4/Table 5 if CSI report #n is configured as ‘typeIIr16’ or ‘typeIIr16- PortSelection’; CSI part 2 subband, as in Table 6.3.2.1.2-5 [REF7] otherwise, if CSI part 2 exists for CSI report #n where CSI report #1, CSI report #2, . . . , CSI report #n in Table 6.3.2.1.2-7 correspond to the CSI reports in increasing order of CSI report priority values according to Subclause 5.2.5 of [REF8].

TABLE 4 Mapping order of CSI fields of one CSI report, CSI part 2 of codebookType = typeIIr16 or typeIIr16-PortSelection CSI report number CSI fields CSI report #n PMI fields X1, from left to right as in Table 1/Table 2, if CSI part 2, reported group 0 CSI report #n The following PMI fields X2, from left to right, as in Table 1/Table 2: CSI part 2, group 1 ${\left\{ {{{i_{2,3,l}:l} = 1},\ldots\ ,v} \right\},i_{1,5},{i_{1,6,l}{and}\left( {\left\lceil \frac{K_{{NZ},{TOT}}}{2} \right\rceil - v} \right) \times 3{highest}{priority}}}{{{bits}{of}\left\{ {{{i_{2,4,l}:l} = 1},\ldots\ ,v} \right\}},{\left( {\left\lceil \frac{K_{{NZ},{TOT}}}{2} \right\rceil - v} \right) \times 4{highest}{priority}}}{{{bits}{of}\left\{ {{{i_{2,5,l}:l} = 1},\ldots,v} \right\}{and}v*2{LM}} - {\left\lfloor {K_{{NZ},{TOT}}/2} \right\rfloor{highest}{priority}}}{{{bits}{of}\left\{ {{{i_{1,7,l}\text{:}l} = 1},\ldots\ ,v} \right\}},}$ in decreasing order of priority based on function Pri(l, i, f) defined in section 5.2.3 of [REF8], if reported CSI report #n The following PMI fields X2, from left to right, as in Table 1/ CSI part 2, Table 2: [K_(NZ,tot)/2] × 3 lowest priority bits of {i_(2,4,l): l = 1, . . . , v}, [K_(NZ,tot)/2] × 4 group 2 lowest priority bits of {i_(2,5,l) : l = 1, . . . , v} and [K_(NZ,tot)/2] lowest priority bits of {i_(1,7,l): l = 1, . . . , v}, in decreasing order of priority based on function Pri(l, i, f) defined in section 5.2.3 of [REF8], if reported

TABLE 5 Mapping order of CSI fields of one CSI report, CSI part 2 of codebookType = typeIIr16 or typeIIr16-PortSelection CSI report number CSI fields CSI report #n PMI fields X1, from left to right, as in Table 1/Table 2, if reported CSI part 2, group 0 CSI report #n The following PMI fields X2, from left to right, as in Table 1/Table 2: CSI part 2, group 1 ${\left\{ {{{i_{2,3,l}:l} = 1},\ldots\ ,v} \right\},i_{1,5},{i_{1,6,l}{{and}\left( {\left\lceil \frac{K_{{NZ},{TOT}}}{2} \right\rceil - v} \right)} \times 3{highest}{priority}}}{{{bits}{of}\left\{ {{{i_{2,4,l}:l} = 1},\ldots\ ,v} \right\}},{\left( {\left\lceil \frac{K_{{NZ},{TOT}}}{2} \right\rceil - v} \right) \times 4{highest}{priority}}}{{{bits}{of}\left\{ {{{i_{2,5,l}:l} = 1},\ldots,v} \right\}{and}v*2{LM}} - {\left\lfloor {K_{{NZ},{TOT}}/2} \right\rfloor{highest}{priority}}}{{{bits}{of}\left\{ {{{i_{1,7,l}\text{:}l} = 1},\ldots\ ,v} \right\}},}$ in decreasing order of priority based on function Pri(l, i, f) defined in section 5.2.3 of [REF8], if reported CSI report #n The following PMI fields X2, from left to right, as in Table 1/Table 2: CSI part 2, group 2 ${{\left( {\left\lceil \frac{K_{{NZ},{TOT}}}{2} \right\rceil - v} \right) \times 3{lowest}{priority}{bits}{of}\left\{ {{{i_{2,4,l}:l} = 1},\ldots\ ,v} \right\}},{\left( {\left\lceil \frac{K_{{NZ},{TOT}}}{2} \right\rceil - v} \right) \times 4{lowest}{priority}{bits}{of}\left\{ {{{i_{2,5,l}:l} = 1},\ldots,v} \right\}{and}}}{{\left\lfloor {K_{{NZ},{TOT}}/2} \right\rfloor{lowest}{priority}{bits}{of}\left\{ {{{i_{1,7,l}\text{:}l} = 1},\ldots\ ,v} \right\}},}$ in decreasing order of priority based on function Pri(l, i, f) defined in section 5.2.3 of [REF8], if reported

Any of the above variation embodiments can be utilized independently or in combination with at least one other variation embodiment.

FIG. 17 illustrates a flow chart of a method 1700 for operating a user equipment (UE) for channel state information (CSI) reporting in a wireless communication system, as may be performed by a UE such as UE 116, according to embodiments of the present disclosure. The embodiment of the method 1700 illustrated in FIG. 17 is for illustration only. FIG. 17 does not limit the scope of this disclosure to any particular implementation.

As illustrated in FIG. 17 , the method 1700 begins at step 1702. In step 1702, the UE (e.g., 111-116 as illustrated in FIG. 1 ) receives configuration information for a CSI report.

In step 1704, the UE determines the CSI report comprising a first CSI part and a second CSI part, the second CSI part including a precoding matrix indicator (PMI), the PMI comprising a plurality of PMI components, wherein some of the PMI components comprise sub-components.

In step 1706, the UE determines priority values for the sub-components of the some of the PMI components.

In step 1708, the UE partitions the second CSI part into Group 0, Group 1, and Group 2 such that the sub-components of the some of the plurality of PMI components are divided into Group 1 and Group 2 based on their determined priority values.

In step 1710, the UE transmits, over an uplink (UL) channel, the first CSI part and Group 0 or (Group 0, Group 1) or (Group 0, Group 1, Group 2) of the second CSI part based on a resource allocation for the CSI report.

The priority values for the sub-components are based on a function F_(i)(m) that permutes values {0, 1, 2, . . . , M−1} of an index m associated with the sub-components such that the priority values are sorted in decreasing order as {x₀, y₀′ x₁, y₁, x₂, y₂ . . . . } where {x₀, x₁, x₂, . . . } and {y₀, y₁, y₂, . . . } are two parts of the set of values {0, 1, 2, . . . , M−1} for the index m.

In one embodiment,

${\left\{ {x_{0},x_{1},x_{2},\ldots} \right\} = \left\{ {0,1,2,\ldots,{\left\lceil \frac{M}{2} \right\rceil - 1}} \right\}},{\left\{ {y_{0},y_{1},y_{2},\ldots} \right\} = \left\{ {{M - 1},{M - 2},\ldots,\left\lceil \frac{M}{2} \right\rceil} \right\}},$

and the priority values are sorted in decreasing order as {x₀,y₀, x₁, y₁, x₂, y₂ . . . }={0,M−1,1,M−2, 2, . . . } where

is a ceiling function.

In one embodiment, values {0, 1, 2, . . . , M−1} for the index m correspond to frequency domain (FD) basis vector indices k_(m)=k₀, k₁, . . . k_(M-1), where k_(m)ϵ{0, 1, . . . , N₃−1} and N₃ is a total number of FD basis vectors configured to the UE, and F₁(m) takes a value according to the priority order of a corresponding FD basis vector index k_(m), and is given by F₁(m)=min (2k_(m), 2(N₃−k_(m))−1).

In one embodiment, the some of the PMI components indicate information about a total of K^(NZ) non-zero coefficients across v layers, wherein: v≥1 and is a rank value; K^(NZ)=Σ_(l=1) ^(v)K_(l) ^(NZ); and for each layer l=1, . . . ,v: K_(l) ^(NZ) is a number of non-zero coefficients for layer l, the K_(l) ^(NZ) non-zero coefficients correspond to non-zero coefficients of a 2L×M coefficient matrix C_(l) comprising 2L rows and M columns, and the remaining 2LM−K_(l) ^(NZ) coefficients of the 2L×M coefficient matrix C_(l) are zero, and a priority value P(l, i, m) for a coefficient of the coefficient matrix C_(l) is determined based on layer index (l), row index (i), and column index (m) associated with the coefficient and the function F₁(m) for the column index m as P(l, i, m)=2×L×v×F₁(m)+v×i+l.

In one embodiment, the some of the PMI components include the following: {i_(2,4,l): l=1, . . . , v}, where i_(2,4,l) indicates amplitudes of the K_(l) ^(NZ) non-zero coefficients for layer l; {i_(2,5,l): l=1, . . . , v}, where i_(2,5,l) indicates phases of the K_(l) ^(NZ) non-zero coefficients for layer l; and {i_(1,7,l)l=1, . . . , v}, where i_(1,7,l) indicates indices (i, m) of the K_(l) ^(NZ) non-zero coefficients for layer l; and where each of i_(2,4,l), i_(2,5,l), and i_(1,7,l) comprise 2LM sub-components.

In one embodiment, based on the determined priority values of the Kx^(NZ) non-zero coefficients:

$\left\lceil \frac{K^{NZ}}{2} \right\rceil - \upsilon$

sub-components of {i_(2,4,l): l=1, . . . , v} having a higher priority are included in Group 1,

$\left\lfloor \frac{K^{NZ}}{2} \right\rfloor$

sub-components of {i_(2,4,l): l=1, . . . , v} having a lower priority are included in Group 2, and v sub components of {i_(2,4,l): l=1, . . . , v} corresponding to the strongest coefficients, one for each layer, are excluded from Group 1 and Group 2;

$\left\lceil \frac{K^{NZ}}{2} \right\rceil - \upsilon$

sub-components of {i_(2,5,l): l=1, . . . ,v} having a higher priority are included in Group 1,

$\left\lfloor \frac{K^{NZ}}{2} \right\rfloor$

sub-components of {i_(2,5,l): l=1, . . . , v} having a lower priority are included in Group 2, and v sub-components of {i_(2,5,l): l=1, . . . ,v} corresponding to strongest coefficients, one for each layer, are excluded from Group 1 and Group 2; and

${\upsilon*2{LM}_{\upsilon}} - \left\lfloor \frac{K^{NZ}}{2} \right\rfloor$

sub-components of {i_(1,7,l): l=1, . . . ,v} having a higher priority are included in Group 1 and

$\left\lfloor \frac{K^{NZ}}{2} \right\rfloor$

sub-components of {i_(1,7,l): l=1, . . . ,v} having a lower priority are included in Group 2.

In one embodiment, a mapping order of the bit-widths of the PMI components in uplink control information (UCI) that carries the CSI report is as follows: Group 0, Group 1, and Group 2 from left to right; for Group 0, PMI components i_(1,1), i_(1,2), i_(1,8,1), i_(1,8,2), i_(1,8,3), and i_(1,8,4) are mapped from left to right; for Group 1, PMI components i_(2,3,1), i_(2,3,2), i_(2,3,3), i_(2,3,4), i_(1,5), i_(1,6,1), i_(1,6,2), i_(1,6,3), i_(1,6,4) and higher priority PMI components of i_(2,4,1), i_(2,4,2), i_(2,4,3), i_(2,4,4), i_(2,5,1), i_(2,5,2), i_(2,5,3), i_(2,5,4), i_(1,7,1), i_(1,7,2), i_(1,7,3), i_(1,7,4), are mapped from left to right; and for Group 2, lower priority PMI components of i_(2,4,1), i_(2,4,2), i_(2,4,3), i_(2,4,4), i_(2,5,1), i_(2,5,2), i_(2,5,3), i_(2,5,4), i_(1,7,1), i_(1,7,2), i_(1,7,3), i_(1,7,4), are mapped from left to right, where: left and right correspond to most and least significant bits, respectively, i (i_(1,1), i_(1,2)) indicates L spatial domain (SD) basis vectors, i (i_(1,5), i_(2,4,l)) indicates M FD basis vectors for layer l, i_(1,8,l) indicates an index (i, m) of the strongest coefficient for layer l, i_(2,3,l) indicates a reference amplitude for layer l, i_(1,7,l) comprises 2LM sub-components, each indicating an index (i, m) of a non-zero coefficient for layer l, i_(2,4,l) comprises 2LM sub-components, each indicating an amplitude of a non-zero coefficient for layer l, and i_(2,5,l) comprises 2LM sub-components, each indicating a phase of a non-zero coefficient for layer l.

FIG. 18 illustrates a flow chart of another method 1800, as may be performed by a base station (BS) such as BS 102, according to embodiments of the present disclosure. The embodiment of the method 1800 illustrated in FIG. 18 is for illustration only. FIG. 18 does not limit the scope of this disclosure to any particular implementation.

As illustrated in FIG. 18 , the method 1800 begins at step 1802. In step 1802, the BS (e.g., 101-103 as illustrated in FIG. 1 ), generates CSI configuration information.

In step 1804, the BS transmits the CSI configuration information for a CSI report comprising a first CSI part and a second CSI part.

In step 1806, the BS receives, from the UE over an uplink (UL) channel, UL the CSI part and Group 0 or (Group 0, Group 1) or (Group 0, Group 1, Group 2) of the second CSI part based on a resource allocation for the CSI report.

The second CSI part includes a precoding matrix indicator (PMI), the PMI comprising a plurality of PMI components, wherein some of the PMI components comprise sub-components.

The second CSI part is partitioned into Group 0, Group 1, and Group 2 such that the sub-components of the some of the plurality of PMI components are divided into Group 1 and Group 2 based on priority values of the sub-components.

The priority values for the sub-components are based on a function F₁(m) that permutes values {0, 1, 2, . . . , M−1} of an index m associated with the sub-components such that the priority values are sorted in decreasing order as {x₀, y₀, x₁, y₁, x₂, y₂ . . . . } where {x₀, x₁, x₂, . . . } and {y₀, y₁, y₂, . . . } are two parts of the set of values {0, 1, 2, . . . , M−1} for the index m.

In one embodiment,

${\left\{ {x_{0},x_{1},x_{2},\ldots} \right\} = \left\{ {0,1,2,\ldots,{\left\lceil \frac{M}{2} \right\rceil - 1}} \right\}},{\left\{ {y_{0},y_{1},y_{2},\ldots} \right\} = \left\{ {{M - 1},{M - 2},\ldots,\left\lceil \frac{M}{2} \right\rceil} \right\}},$

and the priority values are sorted in decreasing order as {x₀,y₀, x₁, y₁, x₂, y₂ . . . . }={0,M−1,1,M−2, 2, . . . } where

is a ceiling function.

In one embodiment, values {0, 1, 2, . . . , M−1} of the index m correspond to frequency domain (FD) basis vector indices k_(m)=k₀, k₁, . . . k_(M-1), where k_(m)ϵ{0, 1, . . . , N₃−1} and N₃ is a total number of FD basis vectors configured to the UE, and F₁(m) takes a value according to the priority order of a corresponding FD basis vector index k_(m), and is given by F₁(m)=min (2k_(m), 2(N₃−k_(m))−1).

In one embodiment, the some of the PMI components indicate information about a total of K^(NZ) non-zero coefficients across v layers, wherein: v≥1 and is a rank value; K^(NZ)=Σ_(l=1) ^(v)K_(l) ^(NZ); and for each layer l=1, . . . ,v: K_(l) ^(NZ) is a number of non-zero coefficients for layer l, the K_(l) ^(NZ) non-zero coefficients correspond to non-zero coefficients of a 2L×M coefficient matrix C_(l) comprising 2L rows and M columns, and the remaining 2LM−K_(l) ^(NZ) coefficients of the 2L×M coefficient matrix C_(l) are zero, and a priority value P(l, i, m) for a coefficient c_(l,i,m) of the coefficient matrix C_(l) is determined based on layer index (l), row index (i), and column index (m) associated with the coefficient c_(l,i,m) and the function F₁(m) for the column index m as P(l, i, m)=2×L×v×F₁(m)+v×i+l.

In one embodiment, the some of the PMI components include the following: {i_(2,4,l): l=1, . . . , v}, where i_(2,4,l) indicates amplitudes of the K_(l) ^(NZ) non-zero coefficients for layer l; {i_(2,5,l): l=1, . . . , v}, where i_(2,5,l) indicates phases of the K_(l) ^(NZ) non-zero coefficients for layer l; and {i_(1,7,l):l=1, . . . , v}, where i_(1,7,l) indicates indices (i, m) of the K_(l) ^(NZ) non-zero coefficients for layer l; and where each of i_(2,4,l), i_(2,5,l), and i_(1,7,l) comprise 2LM sub-components.

In one embodiment, based on the determined priority values of the K^(NZ) non-zero coefficients:

$\left\lceil \frac{K^{NZ}}{2} \right\rceil - \upsilon$

sub-components of {i_(2,4,l): l=1, . . . , v} having a higher priority are included in Group 1,

$\left\lfloor \frac{K^{NZ}}{2} \right\rfloor$

sub-components of {i_(2,4,l): l=1, . . . , v} having a lower priority are included in Group 2, and v sub components of {i_(2,4,l): l=1, . . . , v} corresponding to the strongest coefficients, one for each layer, are excluded from Group 1 and Group 2;

$\left\lceil \frac{K^{NZ}}{2} \right\rceil - \upsilon$

sub-components of {i_(2,5,l): l=1, . . . , v} having a higher priority are included in Group 1,

$\left\lfloor \frac{K^{NZ}}{2} \right\rfloor$

sub-components of {i_(2,5,l): l=1, . . . , v} having a lower priority are included in Group 2, and v sub-components of {i_(2,5,l): l=1, . . . ,v} corresponding to the strongest coefficients, one for each layer, are excluded from Group 1 and Group 2; and

${\upsilon*2{LM}_{\upsilon}} - \left\lfloor \frac{K^{NZ}}{2} \right\rfloor$

sub-components of {i_(1,7,l):l=1, . . . , v} having a higher priority are included in Group 1 and

$\left\lfloor \frac{K^{NZ}}{2} \right\rfloor$

sub-components of {i_(1,7,i): l=1, . . . , v} having a lower priority are included in Group 2.

In one embodiment, a mapping order of the bit-widths of the PMI components in uplink control information (UCI) that carries the CSI report is as follows: Group 0, Group 1, and Group 2 from left to right; for Group 0, PMI components i_(1,1), i_(1,2), i_(1,8,1), i_(1,8,2), i_(1,8,3), and i_(1,8,4) are mapped from left to right; for Group 1, PMI components i_(2,3,1), i_(2,3,2), i_(2,3,3), i_(2,3,4), i_(1,5), i_(1,6,1), i_(1,6,2), i_(1,6,3), i_(1,6,4) and higher priority PMI components of i_(2,4,1), i_(2,4,2), i_(2,4,3), i_(2,4,4), i_(2,5,1), i_(2,5,2), i_(2,5,3), i_(2,5,4), i_(1,7,1), i_(1,7,2), i_(1,7,3), i_(1,7,4), are mapped from left to right; and for Group 2, lower priority PMI components of i_(2,4,1), i_(2,4,2), i_(2,4,3), i_(2,4,4), i_(2,5,1), i_(2,5,2), i_(2,5,3), i_(2,5,4), i_(1,7,1), i_(1,7,2), i_(1,7,3), i_(1,7,4), are mapped from left to right, where: left and right correspond to most and least significant bits, respectively, (i_(1,1), i_(1,2)) indicates L spatial domain (SD) basis vectors, (i_(1,5), i_(2,4,l)) indicates M FD basis vectors for layer l, i_(1,8,l) indicates an index (i, m) of the strongest coefficient for layer l, i_(2,3,l) indicates a reference amplitude for layer l, i_(1,7,l) comprises 2LM sub-components, each indicating an index (i, m) of a non-zero coefficient for layer l, i_(12,4,l) comprises 2LM sub-components, each indicating an amplitude of a non-zero coefficient for layer l, and i_(2,5,l) comprises 2LM sub-components, each indicating a phase of a non-zero coefficient for layer l.

Although the present disclosure has been described with an exemplary embodiment, various changes and modifications may be suggested to one skilled in the art. It is intended that the present disclosure encompass such changes and modifications as fall within the scope of the appended claims. None of the description in this application should be read as implying that any particular element, step, or function is an essential element that must be included in the claims scope. The scope of patented subject matter is defined by the claims. 

What is claimed is:
 1. A user equipment (UE) comprising: a transceiver configured to receive configuration information about a channel state information (CSI) report; and a controller operably coupled to the transceiver, the controller configured to: determine the CSI report including a first CSI part and a second CSI part, and partition the second CSI part into Group 0, Group 1, and Group 2, and wherein: the transceiver is further configured to transmit the first CSI part and at least a portion of the second CSI part based on a resource allocation for the CSI report, the at least a portion of the second CSI part is one of: (i) Group 0 (ii) Group 0 and Group 1, or (iii) Group 0, Group 1, and Group 2, and a mapping order of CSI fields in the second CSI part is according to a table: CSI report number CSI fields Group 0 Precoding matrix indicator (PMI) fields X₁, from left to right as in Table 1/Table 2, if reported Group 1 Following PMI fields X₂, from left to right, as in Table 1/Table 2: (i_(2, 3, l): l = 1, ..., v}, i_(1, 5), i_(1, 6, l) and (T₁) × 3 highest priority bits of (i_(2, 4, l): l = 1, ..., v}, (T₁) × 4 highest priority bits of {i_(2, 5, l): l = 1, ..., v} and v * 2LM − 

 K_(NZ, TOT)/2 

 highest priority bits of (i_(1, 7, l): l = 1, ..., v}, in decreasing order of priority based on function Pri(l, i, f), if reported Group 2 Following PMI fields X₂, from left to right, as in Table 1/Table 2: T₂ × 3 lowest priority bits of (i_(2, 4, l): l = 1,..., v}, T₂ × 4 lowest priority bits of (i_(2, 5, l): l = 1, ..., v} and  

 K_(NZ, TOT)/2 

 lowest priority bits of (i_(1, 7, l): l = 1,..., v}, in decreasing order of priority based on function Pri(l, i, f), if reported


2. The UE of claim 1, wherein $T_{1} = {{\left\lceil \frac{K_{{NZ},{TOT}}}{2} \right\rceil - {v{and}T_{2}}} = {\left\lfloor {K_{{NZ},{TOT}}/2} \right\rfloor.}}$
 3. The UE of claim 1, wherein Table 1 and Table 2 are given by: TABLE 1 Information fields X_(i) for PMI (for Group 0) i_(1,1) i_(1,2) i_(1,8,1) i_(1,8,2) i_(1,8,3) i_(1,8,4) Rank = l [log₂(O₁O₂)] $\left\lceil {\log_{2}\left( \frac{N_{1}N_{2}}{L} \right)} \right\rceil$

 log₂ K_(NZ,tot )

N/A N/A N/A Rank = 2 [log₂(O₁O₂)] $\left\lceil {\log_{2}\left( \frac{N_{1}N_{2}}{L} \right)} \right\rceil$

 log₂(2L) 

 log₂(2L) 

N/A N/A Rank = 3 [log₂(O₁O₂)] $\left\lceil {\log_{2}\left( \frac{N_{1}N_{2}}{L} \right)} \right\rceil$

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

N/A Rank = 4 [log₂(O₁O₂)] $\left\lceil {\log_{2}\left( \frac{N_{1}N_{2}}{L} \right)} \right\rceil$

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

Information fields X₂ for PMI (for Group 1) i_(1,5) i_(1,6,1) i_(1,6,2) i_(1,6,3) i_(1,6,4) i_(1,7,1) i_(1,7,2) i_(1,7,3) i_(1,7,4) i_(2,3,1) i_(2,3,2) i_(2,3,3) i_(2,3,4) Rank = l 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ N/A N/A N/A 2LM_(v) N/A N/A N/A 4 N/A N/A N/A if N₃ > 19 if N₃ ≤ 19; $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ if N₃ > 19 Rank = 2 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ N/A N/A 2LM_(v) 2LM_(v) N/A N/A 4 4 N/A N/A if N₃ > 19 if N₃ ≤ 19; if N₃ ≤ 19; $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ N/A N/A 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ > 19 Rank = 3 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ N/A 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ ≤ 19; $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ if N₃ > 19 Rank = 4 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ ≤ 19; $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ if N₃ > 19 Information fields X₂ for PMI (for Group 2) i_(2,4,1) i_(2,4,2) i_(2,4,3) i_(2,4,4) i_(2,5,1) i_(2,5,2) i_(2,5,3) i_(2,5,4) Rank = l 3(K_(NZ,1) − 1) N/A N/A N/A 4(K_(NZ,1) − 1) N/A N/A N/A Rank = 2 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) N/A N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 1) N/A N/A Rank = 3 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 1) 4(K_(NZ,3) − 1) N/A Rank = 4 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) 3(K_(NZ,4) − 1) 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 1) 4(K_(NZ,3) − 1) 4(K_(NZ,4) − 1);

and TABLE 2 Information fields X_(i) for PMI (for Group 0) i_(1,1) i_(1,8,1) i_(1,8,2) i_(1,8,3) i_(1,8,4) Rank = l $\left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil$

 log₂ K_(NZ,tot )

N/A N/A N/A Rank = 2 $\left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil$

 log₂(2L) 

 log₂(2L) 

N/A N/A Rank = 3 $\left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil$

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

N/A Rank = 4 $\left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil$

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

Information fields X₂ for PMI (for Group 1) i_(1,5) i_(1,6,1) i_(1,6,2) i_(1,6,3) i_(1,6,4) i_(1,7,1) i_(1,7,2) i_(1,7,3) i_(1,7,4) i_(2,3,1) i_(2,3,2) i_(2,3,3) i_(2,3,4) Rank = l 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ N/A N/A N/A 2LM_(v) N/A N/A N/A 4 N/A N/A N/A if N₃ > 19 if N₃ ≤ 19; $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ if N₃ > 19 Rank = 2 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ N/A N/A 2LM_(v) 2LM_(v) N/A N/A 4 4 N/A N/A if N₃ > 19 if N₃ ≤ 19; if N₃ ≤ 19; $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ N/A N/A 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ > 19 Rank = 3 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ N/A 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ ≤ 19; if N₃ ≤ 19; if N₃ ≤ 19; $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ if N₃ > 19 if N₃ > 19 if N₃ > 19 Rank = 4 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ ≤ 19; if N₃ ≤ 19; if N₃ ≤ 19; if N₃ ≤ 19; $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ if N₃ > 19 if N₃ > 19 if N₃ > 19 if N₃ > 19 Information fields X₂ for PMI (for Group 2) i_(2,4,1) i_(2,4,2) i_(2,4,3) i_(2,4,4) i_(2,5,1) i_(2,5,2) i_(2,5,3) i_(2,5,4) Rank = 3(K_(NZ,1) − 1) N/A N/A N/A 4(K_(NZ,1) − 1) N/A N/A N/A l Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) N/A N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − N/A N/A 2 1) Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 4(K_(NZ,3) − N/A 3 1) 1) Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) 3(K_(NZ,4) − 1) 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 4(K_(NZ,3) − 4(K_(NZ,4) − 4 1) 1) 1).


4. The UE of claim 1, wherein: Pri(l, i, f)=2L.v.F₁(m)+v.i+l, where v≥1 and is a rank value indicated by a rank indicator (RI), where L is a parameter associated with a number of beams configured by the configuration information, where i=0, 1, . . . , 2L−1 is a spatial domain (SD) beam index, where l=1, 2, . . . , v is a layer index, and where m=0, 1, 2, . . . , M_(v)−1 is a frequency domain (FD) index, and M_(v) is a number of FD basis vectors, a function F₁(m) permutes values {0, 1, 2, . . . , M_(v)−1 of the FD index m based on a permutation order of basis vector indices k_(m)=k₀, k₁, . . . , k_(M) _(v) −1 which correspond to the FD index m, where k_(m)ϵ{0, 1, . . . , N₃−1} and N₃ is determined based on a number of subbands configured to the UE, and the FD basis vector indices k_(m) are permuted based on a function given by min(2k_(m), 2(N₃−k_(m))−1).
 5. The UE of claim 1, wherein: the second CSI part includes a precoding matrix indicator (PMI), the PMI comprising indices i₁ and i₂, each comprising a plurality of components, $i_{1} = \left\{ \begin{matrix} {\left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}} \right\rbrack} & {\upsilon = 1} \\ {\left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}i_{1,6,2}i_{1,7,2}i_{1,8,2}} \right\rbrack} & {\upsilon = 2} \\ {\left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}i_{1,6,2}i_{1,7,2}i_{1,8,2}i_{1,6,3}i_{1,7,3}i_{1,8,3}} \right\rbrack} & {\upsilon = 3} \\ \left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}i_{1,6,2}i_{1,7,2}i_{1,8,2}i_{1,6,3}i_{1,7,3}i_{1,8,3}i_{1,6,4}i_{1,7,4}i_{1,8,4}} \right\rbrack & {\upsilon = 4} \end{matrix} \right.$ $i_{2} = \left\{ \begin{matrix} {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}} \right\rbrack} & {\upsilon = 1} \\ {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}i_{2,3,2}i_{2,4,2}i_{2,5,2}} \right\rbrack} & {\upsilon = 2} \\ {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}i_{2,3,2}i_{2,4,2}i_{2,5,2}i_{2,3,3}i_{2,4,3}i_{2,5,3}} \right\rbrack} & {\upsilon = 3} \\ \left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}i_{2,3,2}i_{2,4,2}i_{2,5,2}i_{2,3,3}i_{2,4,3}i_{2,5,3}i_{2,3,4}i_{2,4,4}i_{2,5,4}} \right\rbrack & {\upsilon = 4} \end{matrix} \right.$ i_(2,4,l), i_(2,5,l), and i_(1,7,l) comprise sub-components and indicate information on nonzero coefficients across v layers, the sub-components are divided into Group 1 and Group 2 based on identified priority values Pri for each sub-component, and a sub-component with a higher priority has a lower priority value Pri.
 6. The UE of claim 5, wherein: {i_(2,4,l): l=1, . . . , v}, where i_(2,4,l) indicates amplitudes of non-zero coefficients for layer l, where K_(NZ,l) is a number of non-zero coefficients for layer l; {i_(2,5,l):l=1, . . . , v}, where i_(2,5,l) indicates phases of the K_(NZ,l) non-zero coefficients for layer l; {i_(1,7,l):l=1, . . . , v}, where i_(1,7,l) indicates indices (i, m) of the K_(NZ,l) non-zero coefficients for layer l; and wherein each of i_(2,4,l), i_(2,5,l), and i_(1,7,l) comprise 2LM_(v) sub-components.
 7. The UE of claim 5, wherein based on the identified priority values of each of the K_(NZ,TOT) non-zero coefficients across v layers, where K_(NZ,TOT)=Σ_(l=1) ^(v)K_(NZ,l): T₁ sub-components of {i_(2,4,l):l=1, . . . , v} having a higher priority are included in Group 1 and T₂ sub-components of {i_(2,4,l): l=1, . . . , v} having a lower priority are included in Group 2; T₁ sub components of {i_(2,5,l): l=1, . . . , v} having a higher priority are included in Group 1, T₂ sub components of {i_(2,5,l): l=1, . . . , v} having a lower priority are included in Group 2; and ${\upsilon*2{LM}_{\upsilon}} - \left\lfloor \frac{K_{{NZ},{TOT}}}{2} \right\rfloor$ sub-components of {i_(1,7,l): l=1, . . . ,v} having a higher priority are included in Group 1 and $\left\lfloor \frac{K_{{NZ},{TOT}}}{2} \right\rfloor$ sub-components of {i_(1,7,l): l=1, . . . , v} having a lower priority are included in Group
 2. 8. A base station (BS) comprising: a transceiver configured to: transmit configuration information about a channel state information (CSI) report, wherein the CSI report includes a first CSI part and a second CSI part, and the second CSI part is partitioned into Group 0, Group 1, and Group 2; and receive the first CSI part and at least a portion of the second CSI part based on a resource allocation for the CSI report, wherein the at least a portion of the second CSI part is one of: (i) Group 0 (ii) Group 0 and Group 1, or (iii) Group 0, Group 1, and Group 2, and wherein a mapping order of CSI fields in the second CSI part is according to a table: CSI report number CSI fields Group 0 Precoding matrix indicator (PMI) fields X₁, from left to right as in Table 1/Table 2, if reported Group 1 Following PMI fields X₂, from left to right, as in Table 1/Table 2: (i_(2, 3, l) : l = 1, ..., v}, i_(1, 5), i_(1, 6, l) and (T₁) × 3 highest priority bits of (i_(2, 4, l): l = 1,(T₁) × 4 highest priority bits of {i_(2, 5, l): l = 1, ..., v} and v * 2LM −  

 K_(NZ, TOT)/2 

 highest priority bits of (i_(1, 7, l): l = 1, ..., v} in decreasing order of priority based on function Pri(l, i, f), if reported Group 2 Following PMI fields X₂, from left to right, as in Table 1/Table 2: T₂ × 3 lowest priority bits of (i_(2, 4, l): l = 1,..., v}, T₂ × 4 lowest priority bits of (i_(2, 5, l): l = 1, ..., v} and  

 K_(NZ, TOT)/2 

 lowest priority bits of (i_(1, 7, l): l = 1, ..., v}, in decreasing order of priority based on function Pri(l, i, f), if reported


9. The BS of claim 8, wherein $T_{1} = {{\left\lceil \frac{K_{{NZ},{TOT}}}{2} \right\rceil - {v{and}T_{2}}} = {\left\lfloor {K_{{NZ},{TOT}}/2} \right\rfloor.}}$
 10. The BS of claim 8, wherein Table 1 and Table 2 are given by: TABLE 1 Information fields X_(i) for PMI (for Group 0) i_(1,1) i_(1,2) i_(1,8,1) i_(1,8,2) i_(1,8,3) i_(1,8,4) Rank = l [log₂(O₁O₂)] $\left\lceil {\log_{2}\left( \frac{N_{1}N_{2}}{L} \right)} \right\rceil$

 log₂ K_(NZ,tot )

N/A N/A N/A Rank = 2 [log₂(O₁O₂)] $\left\lceil {\log_{2}\left( \frac{N_{1}N_{2}}{L} \right)} \right\rceil$

 log₂(2L) 

 log (21) 

N/A N/A Rank = 3 [log₂(O₁O₂)] $\left\lceil {\log_{2}\left( \frac{N_{1}N_{2}}{L} \right)} \right\rceil$

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

N/A Rank = 4 [log₂(O₁O₂)] $\left\lceil {\log_{2}\left( \frac{N_{1}N_{2}}{L} \right)} \right\rceil$

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

Information fields X₂ for PMI (for Group 1) i_(1,5) i_(1,6,1) i_(1,6,2) i_(1,6,3) i_(1,6,4) i_(1,7,1) i_(1,7,2) i_(1,7,3) i_(1,7,4) i_(2,3,1) i_(2,3,2) i_(2,3,3) i_(2,3,4) Rank = l 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ N/A N/A N/A 2LM_(v) N/A N/A N/A 4 N/A N/A N/A if N₃ > 19 if N₃ ≤ 19; $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ if N₃ > 19 Rank = 2 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ N/A N/A 2LM_(v) 2LM_(v) N/A N/A 4 4 N/A N/A if N₃ > 19 if N₃ ≤ 19; if N₃ ≤ 19; $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ N/A N/A 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ > 19 Rank = 3 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ N/A 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ ≤ 19; $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ if N₃ > 19 Rank = 4 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{N_{3}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ ≤ 19; $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 Information fields X for PMI (for Group 2) i_(2,4,1) i_(2,4,2) i_(2,4,3) i_(2,4,4) i_(2,5,1) i_(2,5,2) i_(2,5,3) i_(2,5,4) Rank = 3(K_(NZ,1) − 1) N/A N/A N/A 4(K_(NZ,1) − 1) N/A N/A N/A l Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) N/A N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − N/A N/A 2 1) Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − N/A 3 1) Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) 3(K_(NZ,4) − 1) 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 4(K_(NZ,3) − 4(K_(NZ,4) − 4 1) 1) 1);

and TABLE 2 Information fields X_(i) for PMI (for Group 0) i_(1,1) i_(1,8,1) i_(1,8,2) i_(1,8,3) i_(1,8,4) Rank = l $\left. \left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil \right|$

log₂ K_(NZ,tot)

N/A N/A N/A Rank = 2 $\left. \left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil \right|$

log₂(2L)

log₂(2L)

N/A N/A Rank = 3 $\left. \left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil \right|$

log₂(2L)

log₂(2L)

log₂(2L)

N/A Rank = 4

log₂(2L)

log₂(2L)

log₂(2L)

log₂(2L)

Information fields X₂ for PMI (for Group 1) i_(1,5) i_(1,6,1) i_(1,6,2) i_(1,6,3) i_(1,6,4) i_(1,7,1) i_(1,7,2) i_(1,7,3) i_(1,7,4) i_(2,3,1) i_(2,3,2) i_(2,3,3) i_(2,3,4) Rank = l 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ N/A N/A N/A 2LM_(v) N/A N/A N/A 4 N/A N/A N/A if N₃ > 19 if N₃ ≤ 19; $\left\lceil \left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil \right.$ if N₃ > 19 Rank = 2 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ N/A N/A 2LM_(v) 2LM_(v) N/A N/A 4 4 N/A N/A if N₃ > 19 if N₃ ≤ 19; if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ N/A N/A 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ > 19 Rank = 3 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ N/A 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ ≤ 19; if N₃ ≤ 19; if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 if N₃ > 19 if N₃ > 19 Rank = 4 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ ≤ 19; if N₃ ≤ 19; if N₃ ≤ 19; if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 if N₃ > 19 if N₃ > 19 if N₃ > 19 Information fields X₂ for PMI (for Group 2) i_(2,4,1) i_(2,4,2) i_(2,4,3) i_(2,4,4) i_(2,5,1) i_(2,5,2) i_(2,5,3) i_(2,5,4) Rank = 3(K_(NZ,1) − 1) N/A N/A N/A 4(K_(NZ,1) − 1) N/A N/A N/A 1 Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) N/A N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 1) N/A N/A 2 Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 1) 4(K_(NZ,3) − 1) N/A 3 Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) 3(K_(NZ,4) − 1) 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 1) 4(K_(NZ,3) − 1) 4(K_(NZ,4) − 1). 4


11. The BS of claim 8, wherein: Pri(l, i, f)=2L.v.F₁(m)+v.i+1, where v≥1 and is a rank value indicated by a rank indicator (RI), where L is a parameter associated with a number of beams configured by the configuration information, where i=0, 1, . . . , 2L−1 is a spatial domain (SD) beam index, where l=1, 2, . . . , v is a layer index, and where m=0, 1, 2, . . . , M_(v)−1 is a frequency domain (FD) index, and M_(v) is a number of FD basis vectors, a function F₁(m) permutes values {0, 1, 2, . . . , M_(v)−1 of the FD index m based on a permutation order of basis vector indices k_(m)=k₀, k₁, . . . , k_(M) _(v) −1 which correspond to the FD index m, where k_(m)ϵ{0, 1, . . . , N₃−1} and N₃ is determined based on a number of subbands configured to the UE, and the FD basis vector indices k_(m) are permuted based on a function given by min(2k_(m), 2(N₃−k_(m))−1).
 12. The BS of claim 8, wherein: the second CSI part includes a precoding matrix indicator (PMI), the PMI comprising indices i₁ and i₂, each comprising a plurality of components, $i_{1} = \left\{ \begin{matrix} {\left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}} \right\rbrack} & {\upsilon = 1} \\ {\left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}i_{1,6,2}i_{1,7,2}i_{1,8,2}} \right\rbrack} & {\upsilon = 2} \\ {\left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}i_{1,6,2}i_{1,7,2}i_{1,8,2}i_{1,6,3}i_{1,7,3}i_{1,8,3}} \right\rbrack} & {\upsilon = 3} \\ \left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}i_{1,6,2}i_{1,7,2}i_{1,8,2}i_{1,6,3}i_{1,7,3}i_{1,8,3}i_{1,6,4}i_{1,7,4}i_{1,8,4}} \right\rbrack & {\upsilon = 4} \end{matrix} \right.$ $i_{2} = \left\{ \begin{matrix} {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}} \right\rbrack} & {\upsilon = 1} \\ {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}i_{2,3,2}i_{2,4,2}i_{2,5,2}} \right\rbrack} & {\upsilon = 2} \\ {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}i_{2,3,2}i_{2,4,2}i_{2,5,2}i_{2,3,3}i_{2,4,3}i_{2,5,3}} \right\rbrack} & {\upsilon = 3} \\ {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}i_{2,3,2}i_{2,4,2}i_{2,5,2}i_{2,3,3}i_{2,4,3}i_{2,5,3}i_{2,3,4}i_{2,4,4}i_{2,5,4}} \right\rbrack} & {\upsilon = 4} \end{matrix} \right.$ i_(2,4,l), i_(2,5,l), and i_(1,7,l) comprise sub-components and indicate information on nonzero coefficients across v layers, the sub-components are divided into Group 1 and Group 2 based on identified priority values Pri for each sub-component, and a sub-component with a higher priority has a lower priority value Pri.
 13. The BS of claim 12, wherein: {i_(2,4,l): l=1, . . . , v}, where i_(2,4,l) indicates amplitudes of non-zero coefficients for layer l, where K_(NZ,l) is a number of non-zero coefficients for layer l; {i_(2,5,l):l=1, . . . , v}, where i_(2,5,l) indicates phases of the K_(NZ,l) non-zero coefficients for layer l; {i_(1,7,l):l=1, . . . ,v}, where i_(1,7,l) indicates indices (i, m) of the K_(NZ,l) non-zero coefficients for layer l; and wherein each of i_(2,4,l), i_(2,5,l), and i_(1,7,l) comprise 2LM_(v) sub-components.
 14. The BS of claim 12, wherein based on the identified priority values of each of the K_(NZ,TOT) non-zero coefficients across v layers, where K_(NZ,TOT)=Σ_(l=1) ^(v)K_(NZ,l): T₁ sub-components of {i_(2,4,l):l=1, . . . , v} having a higher priority are included in Group 1 and T₂ sub-components of {i_(2,4,l):l=1, . . . , v} having a lower priority are included in Group 2; T₁ sub components of {i_(2,5,l): l=1, . . . , v} having a higher priority are included in Group 1, T₂ sub components of {i_(2,5,l): l=1, . . . , v} having a lower priority are included in Group 2; and ${\upsilon*2{LM}_{\upsilon}} - \left\lfloor \frac{K_{{NZ},{TOT}}}{2} \right\rfloor$ sub-components of {i_(1,7,l):l=1, . . . ,v} having a higher priority are included in Group 1 and $\left\lfloor \frac{K_{{NZ},{TOT}}}{2} \right\rfloor$ sub-components of {i_(1,7,l):l=1, . . . , v} having a lower priority are included in Group
 2. 15. A method for operating a user equipment (UE), the method comprising: receiving configuration information about a channel state information (CSI) report; determining the CSI report including a first CSI part and a second CSI part; partitioning the second CSI part into Group 0, Group 1, and Group 2; and transmitting the first CSI part and at least a portion of the second CSI part based on a resource allocation for the CSI report, wherein the at least a portion of the second CSI part is one of: (i) Group 0 (ii) Group 0 and Group 1, or (iii) Group 0, Group 1, and Group 2, and wherein a mapping order of CSI fields in the second CSI part is according to a table: CSI report number CSI fields Group 0 Precoding matrix indicator (PMI) fields X₁, from left to right as in Table 1/Table 2, if reported Group 1 Following PMI fields X₂, from left to right, as in Table l/Table 2: (i_(2, 3, l): l = 1, ..., v}, i_(1, 5), i_(1, 6, l) and (T₁) × 3 highest priority bits of (i_(2, 4, l): l = 1, (T₁) × 4 highest priority bits of {i_(2, 5, l): l = 1, ..., v} and v * 2LM −  

 K_(NZ, TOT)/2 

 highest priority bits of (i_(1, 7, l): l = 1, ..., v}, in decreasing order of priority based on function Pri(l, i, f), if reported Group 2 Following PMI fields X₂, from left to right, as in Table 1/Table 2: T₂ × 3 lowest priority bits of (i_(2, 4, l): l = 1,..., v}, T₂ × 4 lowest priority bits of (i_(2, 5, l): l = 1, ..., v} and  

 K_(NZ, TOT)/2 

  lowest priority bits of (i_(1, 7, l): l = 1, ..., v}, in decreasing order of priority based on function Pri(l, i, f), if reported


16. The method of claim 15, wherein $T_{1} = {{\left\lceil \frac{K_{{NZ},{TOT}}}{2} \right\rceil - {v{and}T_{2}}} = {\left\lfloor {K_{{NZ},{TOT}}/2} \right\rfloor.}}$
 17. The method of claim 15, wherein Table 1 and Table 2 are given by: TABLE 1 Information fields X_(i) for PMI (for Group 0) i_(1,1) i_(1,2) i_(1,8,1) i_(1,8,2) i_(1,8,3) i_(1,8,4) Rank = l [log₂(O₁O₂)] $\left\lceil {\log_{2}\begin{pmatrix} {N_{1}N_{2}} \\ L \end{pmatrix}} \right\rceil$

 log₂ K_(NZ,tot) 

N/A N/A N/A Rank = 2 [log₂(O₁O₂)] $\left\lceil {\log_{2}\left( \frac{2M_{v}}{M_{v}} \right)} \right\rceil$

 log₂(2L) 

 log₂(2L) 

N/A N/A Rank = 3 [log₂(O₁O₂)] $\left\lceil {\log_{2}\begin{pmatrix} {N_{1}N_{2}} \\ L \end{pmatrix}} \right\rceil$

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

N/A Rank = 4 [log₂(O₁O₂)] $\left\lceil {\log_{2}\begin{pmatrix} {N_{1}N_{2}} \\ L \end{pmatrix}} \right\rceil$

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

Information fields X₂ for PMI (for Group 1) i_(1,5) i_(1,6,1) i_(1,6,2) i_(1,6,3) i_(1,6,4) i_(1,7,1) i_(1,7,2) i_(1,7,3) i_(1,7,4) i_(2,3,1) i_(2,3,2) i_(2,3,3) i_(2,3,4) Rank = l 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ N/A N/A N/A 2LM_(v) N/A N/A N/A 4 N/A N/A N/A if N₃ > 19 if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 Rank = 2 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ N/A N/A 2LM_(v) 2LM_(v) N/A N/A 4 4 N/A N/A if N₃ > 19 if N₃ ≤ 19; if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ N/A N/A 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ > 19 Rank = 3 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ N/A 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 Rank = 4 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 Information fields X for PMI (for Group 2) i_(2,4,1) i_(2,4,2) i_(2,4,3) i_(2,4,4) i_(2,5,1) i_(2,5,2) i_(2,5,3) i_(2,5,4) Rank = 3(K_(NZ,1) − 1) N/A N/A N/A 4(K_(NZ,1) − 1) N/A N/A N/A l Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) N/A N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − N/A N/A 2 1) Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 4(K_(NZ,3) − N/A 3 1) 1) Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) 3(K_(NZ,4) − 1) 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 4(K_(NZ,3) − 4(K_(NZ,4) − 4 1) 1) 1);

and TABLE 2 Information fields X_(i) for PMI (for Group 0) i_(1,1) i_(1,8,1) i_(1,8,2) i_(1,8,3) i_(1,8,4) Rank = l $\left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil$

 log₂ K_(NZ,tot )

N/A N/A N/A Rank = 2 $\left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil$

 log₂(2L) 

 log₂(2L) 

N/A N/A Rank = 3 $\left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil$

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

N/A Rank = 4 $\left\lceil {\log_{2}\left\lceil \frac{P_{{CSI} - {RS}}}{2d} \right\rceil} \right\rceil$

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

 log₂(2L) 

Information fields X₂ for PMI (for Group 1) i_(1,5) i_(1,6,1) i_(1,6,2) i_(1,6,3) i_(1,6,4) i_(1,7,1) i_(1,7,2) i_(1,7,3) i_(1,7,4) i_(2,3,1) i_(2,3,2) i_(2,3,3) i_(2,3,4) Rank = l 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ N/A N/A N/A 2LM_(v) N/A N/A N/A 4 N/A N/A N/A if N₃ > 19 if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 Rank = 2 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ N/A N/A 2LM_(v) 2LM_(v) N/A N/A 4 4 N/A N/A if N₃ > 19 if N₃ ≤ 19; if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ N/A N/A 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ > 19 Rank = 3 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ N/A 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ ≤ 19; if N₃ ≤ 19; if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 if N₃ > 19 if N₃ > 19 Rank = 4 0 if N₃ ≤ 19; [log₂ 2M_(v)] $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} N_{3} \\ M_{v} \end{pmatrix}} \right\rceil$ 2LM_(v) 2LM_(v) 2LM_(v) N/A 4 4 4 N/A if N₃ > 19 if N₃ ≤ 19; if N₃ ≤ 19; if N₃ ≤ 19; if N₃ ≤ 19; $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ $\left\lceil {\log_{2}\begin{pmatrix} {2M_{v}} \\ M_{v} \end{pmatrix}} \right\rceil$ if N₃ > 19 if N₃ > 19 if N₃ > 19 if N₃ > 19 Information fields X₂ for PMI (for Group 2) i_(2,4,1) i_(2,4,2) i_(2,4,3) i_(2,4,4) i_(2,5,1) i_(2,5,2) i_(2,5,3) i_(2,5,4) Rank = 3(K_(NZ,1) − 1) N/A N/A N/A 4(K_(NZ,1) − 1) N/A N/A N/A l Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) N/A N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − N/A N/A 2 1) Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) N/A 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 4(K_(NZ,3) − N/A 3 1) 1) Rank = 3(K_(NZ,1) − 1) 3(K_(NZ,2) − 1) 3(K_(NZ,3) − 1) 3(K_(NZ,4) − 1) 4(K_(NZ,1) − 1) 4(K_(NZ,2) − 4(K_(NZ,3) − 4(K_(NZ,4) − 4 1) 1) 1).


18. The method of claim 15, wherein: Pri(l, i, f)=2L.v.F₁(m)+v.i+1, where v≥1 and is a rank value indicated by a rank indicator (RI), where L is a parameter associated with a number of beams configured by the configuration information, where i=0, 1, . . . , 2L−1 is a spatial domain (SD) beam index, where 1=1, 2, . . . , v is a layer index, and where m=0, 1, 2, . . . , M_(v)−1 is a frequency domain (FD) index, and M_(v) is a number of FD basis vectors, a function F₁(m) permutes values {0, 1, 2, . . . , M_(v)−1 of the FD index m based on a permutation order of basis vector indices k_(m)=k₀, k₁, . . . , k_(M) _(v) −1 which correspond to the FD index m, where k_(m)ϵ{0, 1, . . . , N₃−1} and N₃ is determined based on a number of subbands configured to the UE, and the FD basis vector indices k_(m) are permuted based on a function given by min(2k_(m), 2(N₃−k_(m))−1).
 19. The method of claim 15, wherein: the second CSI part includes a precoding matrix indicator (PMI), the PMI comprising indices i₁ and i₂, each comprising a plurality of components, $i_{1} = \left\{ \begin{matrix} {\left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}} \right\rbrack} & {\upsilon = 1} \\ {\left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}i_{1,6,2}i_{1,7,2}i_{1,8,2}} \right\rbrack} & {\upsilon = 2} \\ {\left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}i_{1,6,2}i_{1,7,2}i_{1,8,2}i_{1,6,3}i_{1,7,3}i_{1,8,3}} \right\rbrack} & {\upsilon = 3} \\ \left\lbrack {i_{1,1}i_{1,2}i_{1,5}i_{1,6,1}i_{1,7,1}i_{1,8,1}i_{1,6,2}i_{1,7,2}i_{1,8,2}i_{1,6,3}i_{1,7,3}i_{1,8,3}i_{1,6,4}i_{1,7,4}i_{1,8,4}} \right\rbrack & {\upsilon = 4} \end{matrix} \right.$ $i_{2} = \left\{ \begin{matrix} {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}} \right\rbrack} & {\upsilon = 1} \\ {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}i_{2,3,2}i_{2,4,2}i_{2,5,2}} \right\rbrack} & {\upsilon = 2} \\ {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}i_{2,3,2}i_{2,4,2}i_{2,5,2}i_{2,3,3}i_{2,4,3}i_{2,5,3}} \right\rbrack} & {\upsilon = 3} \\ {\left\lbrack {i_{2,3,1}i_{2,4,1}i_{2,5,1}i_{2,3,2}i_{2,4,2}i_{2,5,2}i_{2,3,3}i_{2,4,3}i_{2,5,3}i_{2,3,4}i_{2,4,4}i_{2,5,4}} \right\rbrack} & {\upsilon = 4} \end{matrix} \right.$ i_(2,4,l), i_(2,5,l), and i_(1,7,l) comprise sub-components and indicate information on nonzero coefficients across v layers, the sub-components are divided into Group 1 and Group 2 based on identified priority values Pri for each sub-component, and a sub-component with a higher priority has a lower priority value Pri.
 20. The method of claim 19, wherein: {i_(2,4,l): l=1, . . . , v}, where i_(2,4,l) indicates amplitudes of non-zero coefficients for layer l, where K_(NZ,l) is a number of non-zero coefficients for layer l; {i_(2,5,l):l=1, . . . , v}, where i_(2,5,l) indicates phases of the K_(NZ,l) non-zero coefficients for layer l; {i_(1,7,l):l=1, . . . , v}, where i_(1,7,l) indicates indices (i, m) of the K_(NZ,l) non-zero coefficients for layer l; and wherein each of i_(2,4,l), i_(2,5,l), and i_(1,7,l) comprise 2LM_(v) sub-components. 